Feature completion in computer-human interactive learning

ABSTRACT

A collection of data that is extremely large can be difficult to search and/or analyze. Relevance may be dramatically improved by automatically classifying queries and web pages in useful categories, and using these classification scores as relevance features. A thorough approach may require building a large number of classifiers, corresponding to the various types of information, activities, and products. Creation of classifiers and schematizers is provided on large data sets. Exercising the classifiers and schematizers on hundreds of millions of items may expose value that is inherent to the data by adding usable meta-data. Some aspects include active labeling exploration, automatic regularization and cold start, scaling with the number of items and the number of classifiers, active featuring, and segmentation and schematization.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. application Ser. No.14/075,701, filed Nov. 8, 2013, entitled “Feature Completion InComputer-Human Interactive Learning,” claims the benefit of U.S.Provisional Application No. 61/845,844, filed Jul. 12, 2013, entitled“Computer-Human Interactive Learning,” and is related by subject matterto the following U.S. Patent Applications which were concurrently filedwith U.S. application Ser. No. 14/075,701: U.S. application Ser. No.14/075,708, entitled “Active Featuring in Computer-Human InteractiveLearning,” U.S. application Ser. No. 14/075,690, entitled “ActiveLabeling for Computer-Human Interactive Learning,”, U.S. applicationSer. No. 14/075,690, entitled “Interactive Concept Editing inComputer-Human Interactive Learning,”, U.S. application Ser. No.14/075,713, entitled “Interactive Entity Extraction in Computer-HumanInteractive Learning,”. The entireties of the aforementionedapplications are incorporated by reference herein.

BACKGROUND

A collection of data that is extremely large can be difficult to searchand/or analyze. For example, in the case of the Web, a large fraction ofthe data is unstructured and value is locked in the data itself. It isnot enough to store the web page of a service provider. For thisinformation to be useful, it needs to be understood. A string of digitscould be a model number, a bank account, or a phone number depending oncontext. For instance, in the context of a ski product, the string“Length: 170,175,180 cm” refers to 3 different ski lengths, not a skilength of 1700 kilometers. An correct interpretation of the data mayresult in useless information.

As an example, if a user enters the two words “mtor” and “stock” into anInternet search engine, and the results largely consist of web pagesrelated to the drug mTor, the search engine has failed to recognize thesearch as a stock quote query. As another example, if a user enters thetwo words “seattle” and “sushi” into an Internet search engine, and theresults largely consist of web pages related to hotels in Seattle, thesearch engine has failed to recognize the search as a restaurant query.While Internet search engines often do a reasonable job for head queriesand documents, the accuracy quickly falls off in the tail because theinformation is not automatically understood by the search engines.

SUMMARY

Relevance of search results may be dramatically improved if queries andweb pages could be automatically classified in useful categories, suchas stock quotes or restaurants, and if these classification scores wereused as relevance features. A thorough approach might require building alarge number of classifiers, corresponding to the various types ofinformation, activities, and products. The number of classifiers mightbe further multiplied by the number of language and the number ofcontext (queries, web pages, ad snippets, product feeds, etc). It isdesirable to bring computer accuracy in classification andschematization tasks to human levels, and to make it easy for ordinarypeople to create computer clones of themselves to perform such tasks atscale. As one example, a tool could be provided that is optimized toallow the creation of classifiers and schematizers on large data sets ina matter of hours. When the classifiers and schematizers are exercisedon hundreds of millions of items, they may expose the value that isinherent to the data by adding usable metadata. Some applications ofsuch a tool include search, advertising, and commerce.

The term schematization as used herein refers to the action ofidentifying and filling the fields of a Schema. For example, the schemaof a recipe could be made of four fields: Title, Description,Ingredients, and Directions. The schematization of a web page for therecipe schema is the action of segmenting the page into one or moreinstances of the recipe schema and filling the fields accordingly.

Internet search engines have built hundreds of classifiers and entityextractors in an attempt to understand queries, web pages, and ads.Unfortunately, the efficacy of the current approaches is limited by thenumber of machine-learning experts, the number of programmers, and thecomplexity of the tasks.

Humans are excellent at extracting semantic meaning from data. This isespecially true when the data was authored for them or by them. Forinstance, they can label (or segment) web pages, queries, or productfeeds with ease. Unfortunately, humans are embarrassingly bad at doingthese things at scale. At ten seconds per page, a lifetime will not belong enough for someone to sift through 100 million web pages toidentify all the pages related to a given topic. Computers have theexact opposite capabilities. They are embarrassingly poor at semanticunderstanding and they are outstanding at doing things at scale. Thephilosophy behind the approach described herein is to build a highlyinteractive and intuitive system that leverages the strengths of bothhumans and computers. “Highly interactive” means that a label or afeature entered by a human should have an immediate effect oncomputation. Within seconds, it should impact which errors are made oravoided, which item should be labeled next, which feature the usershould focus on, and which field of a schema should be added or removed.“Intuitive” means that users should understand the effect of theiractions and how to achieve their goals without requiring machinelearning or programming expertise. This approach requires cycles fromboth computers and humans. The cycles may be tightly intertwined throughquick machine learning “revisions.” Humans are guiding the computers andvice versa.

Another aspect of efficiency is the ability to build on other people'swork. An important contributor to the explosion of the Web was the “viewsource” and copy-paste capability. In machine learning, the copy-pastecapability comes from the fact that trained classifiers can be used asfeatures to other classifiers. By creating a searchable and documentedclassifier repository, people are enabled to build on each other's work.This applies to both classifiers and schematizers.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

FIG. 1 depicts an exemplary operating environment in accordance with anembodiment of the present invention;

FIG. 2 depicts an exemplary data set that represents a corpus ofsearchable data items in accordance with an embodiment of the presentinvention;

FIG. 3 depicts an exemplary probability plot in accordance with anembodiment of the present invention;

FIG. 4 depicts an exemplary Active Labeling Exploration information flowin accordance with an embodiment of the present invention;

FIG. 5 depicts exemplary sampling distributions in accordance with anembodiment of the present invention;

FIG. 6 depicts a summary of exemplary Active Labeling Explorationscaling in accordance with an embodiment of the present invention;

FIG. 7 depicts an exemplary classification function in accordance withan embodiment of the present invention;

FIG. 8 depicts an exemplary interface in accordance with an embodimentof the present invention;

FIG. 9 depicts an exemplary segmentation of a street address inaccordance with an embodiment of the present invention;

FIG. 10 depicts an exemplary trellis representation of a segmenter inaccordance with an embodiment of the present invention;

FIG. 11 depicts exemplary parts of an address that have been extractedfrom a web page in accordance with an embodiment of the presentinvention;

FIG. 12 depicts an exemplary finite state machine for extractingaddresses in accordance with an embodiment of the present invention;

FIG. 13 depicts an exemplary finite state machine trellis forcalculating path probabilities in accordance with an embodiment of thepresent invention;

FIG. 14 depicts exemplary trellis edge-weight functions in accordancewith an embodiment of the present invention;

FIG. 15 depicts exemplary finite state machine modules in accordancewith an embodiment of the present invention;

FIG. 16 depicts an exemplary finite state machine in accordance with anembodiment of the present invention;

FIG. 17 depicts an exemplary screen shot of a system for binary labelingof addresses in accordance with an embodiment of the present invention;

FIG. 18 depicts exemplary search results in a system for binary labelingof addresses in accordance with an embodiment of the present invention;

FIG. 19 depicts an exemplary screen shot of a system for binary labelingof addresses in accordance with an embodiment of the present invention;

FIG. 20 depicts an exemplary screen shot of a system for binary labelingof addresses in accordance with an embodiment of the present invention;

FIG. 21 depicts an exemplary screen shot of a labeling review panel inaccordance with an embodiment of the present invention;

FIG. 22 depicts an exemplary screen shot of a model prediction in auser-labeled document in accordance with an embodiment of the presentinvention;

FIG. 23 depicts an exemplary screen shot of a labeling tool inaccordance with an embodiment of the present invention; and

FIG. 24 depicts an exemplary flow diagram in accordance with anembodiment of the present invention.

DETAILED DESCRIPTION

The approach described herein creates a number of engineering andscientific challenges, which will be discussed. The challenges include:

-   -   Active labeling exploration    -   Automatic regularization and cold start    -   Scaling with the number of items and the number of classifiers    -   Active featuring    -   Segmentation and Schematization

In a first aspect, computer-readable media embodying computer-usableinstructions are provided for facilitating a method of featurecompletion for machine learning. A first set of data items is stored,wherein each data item includes a text stream of words. A dictionary isaccessed, where the dictionary includes a list of words that define aconcept usable as an input feature for training a classifier to scoredata items with a probability of being a positive example or a negativeexample of a particular class of data item. The classifier is trainedwith the dictionary as an input feature. The training includes A) for afirst word position in a text stream within a data item, examining acontext of the first word position, wherein the context includes anumber of words preceding the first word position and a number of wordsfollowing the first word position, B) calculating a probability that aword at the first word position is in the dictionary based on a functionof the words in the context of the first word position, C) determiningwhether or not the word at the first word position is in the dictionary,and D) modifying the function to adjust the calculated probability,based on whether or not the word at the first word position is in thedictionary.

The context of the first word position may not include the first wordposition. The context may be a sliding window that includes a number ofwords immediately preceding a given word position and a number of wordsimmediately following the given word position. Modifying the function toadjust the calculated probability may include A) modifying the functionto increase the probability when the word at the first word position isin the dictionary, and B) modifying the function to decrease theprobability when the word at the first word position is not in thedictionary. The training may occur in a background while a user isediting the dictionary. Measuring whether or not the word at the firstword position is in the dictionary may include determining whether theword corresponds semantically to the concept defined by the list ofwords in the dictionary.

The method may also include one or more of A) determining whether anywords from a given list appear at a center of a window of text aroundthe first word position in which center words in the window of text havebeen removed, B) determining a presence or absence of a verb in thewindow, C) determining a presence or absence of a noun followed by anadjective, or D) determining a number of occurrences of a given word inthe window.

In a second aspect, computer-readable media embodying computer-usableinstructions are provided for facilitating a method of featurecompletion for machine learning. A first set of data items is stored,where each data item includes a text stream of words. A dictionary isaccessed, where the dictionary includes a list of words that define aconcept usable as an input feature for training a classifier to scoredata items with a probability of being a positive example or a negativeexample of a particular class of data item. The classifier is trainedwith the dictionary as an input feature, where for each data item in thefirst set of data items, the training includes A) for a first wordposition in the text stream within the data item, examining a window oftext centered at a second word position in the text stream, where thewindow of text includes one or more words, B) utilizing a probabilityfunction to calculate a probability of the presence, at the first wordposition, of a disjunction of one or more n-grams from the dictionary,based on the one or more words in the window of text, C) determining thepresence or absence, at the first word position, of a disjunction of oneor more n-grams from the dictionary, and D) modifying the probabilityfunction to adjust the probability in a positive or negative directionbased on the determined presence or absence of the disjunction of one ormore n-grams from the dictionary.

When the window of text overlaps the first word position, one or morewords at the first word position may be excluded from the window oftext, and the second word position may be different than the first wordposition or the same as the first word position. The window of text maybe a sliding window that includes a number of words immediatelypreceding a given word position and a number of words immediatelyfollowing the given word position.

Modifying the probability function to adjust the probability may includemodifying the probability function to increase the probability when thedisjunction of the one or more n-grams from the dictionary is present.Modifying the probability function to adjust the probability may alsoinclude modifying the probability function to decrease the probabilitywhen the disjunction of the one or more n-grams from the dictionary isnot present.

In a third aspect, computer-readable media embodying computer-usableinstructions are provided for facilitating a method of featurecompletion for machine learning. A first set of data items is stored,where each data item includes a text stream of words. A dictionary isprovided, where the dictionary includes a list of words that define aconcept usable as an input feature for training a classifier to scoredata items with a probability of being a positive example or a negativeexample of a particular class of data item. A feature is provided thatis trained to calculate a first probability of a presence of adisjunction of one or more n-grams from the dictionary within a streamof one or more words. The feature is utilized to determine the firstprobability of the presence of a disjunction of one or more n-grams fromthe dictionary within a stream of one or more words at a first wordposition in the data item. A classifier is provided that is trainable tocalculate a second probability of the presence of the disjunction of theone or more n-grams from the dictionary within the stream of one or morewords at the first word position, based on one or more words in the dataitem not utilized by the feature to determine the first probability. Theclassifier is utilized to determine the second probability of thepresence of a disjunction of one or more n-grams from the dictionarywithin the stream of one or more words at the first word position, basedon the one or more words in the data item not utilized by the feature todetermine the first probability. An actual presence or absence isdetermined, at the first word position, of the disjunction of the one ormore n-grams from the dictionary. The classifier is modified to adjustthe second probability in a positive or negative direction based on thedetermined actual presence or absence of the disjunction of the one ormore n-grams from the dictionary.

Utilizing the one or more words in the data item not utilized by thefeature may include utilizing a text window that includes a number ofwords immediately preceding a given word position and a number of wordsimmediately following the given word position. The text window may be asliding window.

The feature may measure the presence of a disjunction of words orn-grams at each considered position in a text stream. The feature mayalso be a regular expression operating over strings to predict matchingpositions in text within a string at each considered position. Theclassifier input may include the window of text around the consideredposition in which center words in the window of text have been removed.

The feature may determine one or more of A) whether any words from agiven list appear at the center of a window of text around the firstword position in which center words in the window of text have beenremoved, B) a presence or absence of a verb in the window, C) a presenceor absence of a noun followed by an adjective, or D) a number ofoccurrences of a given word in the window.

Modifying the classifier to adjust the calculated probability mayinclude adjusting the calculated probability in a positive directionwhen the disjunction of the one or more n-grams from the dictionary ispresent. Modifying the classifier to adjust the calculated probabilitymay also include adjusting the calculated probability in a negativedirection when the disjunction of the one or more n-grams from thedictionary is not present.

Having briefly described an overview of some aspects of the invention,an exemplary operating environment suitable for use in implementing someaspects of the invention is described below.

Referring initially to FIG. 1 in particular, an exemplary operatingenvironment for implementing some embodiments of the present inventionis shown and designated generally as computing device 100. Computingdevice 100 is but one example of a suitable computing environment and isnot intended to suggest any limitation as to the scope of use orfunctionality of invention embodiments. Neither should thecomputing-environment 100 be interpreted as having any dependency orrequirement relating to any one or combination of componentsillustrated.

Some embodiments of the invention may be described in the generalcontext of computer code or machine-useable instructions, includingcomputer-executable instructions such as program modules, being executedby a computer or other machine, such as a personal data assistant orother handheld device. Generally, program modules including routines,programs, objects, components, data structures, etc., refer to code thatperform particular tasks or implement particular abstract data types.Some embodiments of the invention may be practiced in a variety ofsystem configurations, including hand-held devices, consumerelectronics, general-purpose computers, more specialty computingdevices, etc. Some embodiments of the invention may also be practiced indistributed computing environments where tasks are performed byremote-processing devices that are linked through a communicationsnetwork.

With reference to FIG. 1, computing device 100 includes a bus 110 thatdirectly or indirectly couples the following devices: memory 112, one ormore processors 114, one or more presentation components 116,input/output ports 118, input/output components 120, and an illustrativepower supply 122. Bus 110 represents what may be one or more busses(such as an address bus, data bus, or combination thereof). Although thevarious blocks of FIG. 1 are shown with lines for the sake of clarity,in reality, delineating various components is not so clear, andmetaphorically, the lines would be more accurately be grey and fuzzy.For example, one may consider a presentation component such as a displaydevice to be an I/O component. Also, processors have memory. Werecognize that such is the nature of the art, and reiterate that thediagram of FIG. 1 is merely illustrative of an exemplary computingdevice that can be used in connection with some embodiments of thepresent invention. Distinction is not made between such categories as“workstation,” “server,” “laptop,” “hand-held device,” etc., as all arecontemplated within the scope of FIG. 1 and reference to “computingdevice.”

Computing device 100 typically includes a variety of computer-readablemedia. By way of example, and not limitation, computer-readable mediamay comprises Random Access Memory (RAM); Read Only Memory (ROM);Electronically Erasable Programmable Read Only Memory (EEPROM); flashmemory or other memory technologies; CDROM, digital versatile disks(DVD) or other optical or holographic media; magnetic cassettes,magnetic tape, magnetic disk storage or other magnetic storage devices,carrier wave or any other medium that can be used to encode desiredinformation and be accessed by computing device 100.

Memory 112 includes computer-storage media in the form of volatileand/or nonvolatile memory. The memory may be removable, nonremovable, ora combination thereof. Exemplary hardware devices include solid-statememory, hard drives, optical-disc drives, etc. Computing device 100includes one or more processors that read data from various entitiessuch as memory 112 or I/O components 120. Presentation component(s) 116present data indications to a user or other device. Exemplarypresentation components include a display device, speaker, printingcomponent, vibrating component, etc.

I/O ports 118 allow computing device 100 to be logically coupled toother devices including I/O components 120, some of which may be builtin. Illustrative components include a microphone, joystick, game pad,satellite dish, scanner, printer, wireless device, etc. . . .

I. The ALE (Active Labeling Exploration) Challenge

Building a classifier (or a schematizer) on a very large data setpresents a unique challenge: From what distribution should the trainingset be drawn? Randomly selecting items from the true distribution maynot yield any positive examples after observing a million samples. Abiased sampling could yield more positives but it may be souncharacteristic of the true distribution that the resulting classifieris unlikely to perform well when deployed into the real world. Considera fictitious scenario where the task is to build a classifier to findcooking recipe pages over the Web. A random selection of pages isunlikely to return any recipes (even after viewing one million pages). Asearch for the term “recipe” would return a biased sample of recipes (itwould find “Numerical Recipes” and miss “Cooking Adventures”). Thetraditional development in four phases: data collection, labeling,training and featuring and tuning, and deploying, is suboptimal and canlead to disasters. For instance, one may discover during deployment thatthe classifier misses many of the ethnic recipes and returns cementmixing pages as cooking recipes. The classifier is not at fault. Theproblem lies with the sampling and the problem formulation. A classifiertrained with a uniform sampling will quickly learn that the constantanswer “not a recipe” is good enough for that distribution. A cleveroperator may tweak the distribution to build a more useful classifier,but this introduces biases that betray the ignorance of the operator.The operator, for instance, may have no knowledge of African recipesuntil the system is deployed and users start complaining. From theoperator's point of view, the world looks like the picture in FIG. 2.FIG. 2 illustrates an exemplary data set 210 (“BIG DATA”) thatrepresents a corpus of data to be searched. Region 212 (within theentire ellipse) represents the positive examples the operator is awareof. Regions 214 (the entire region within both ellipses) represents allpositive examples within the corpus 210. Region 216 (within the entireellipse) represents examples, which the classifier labels as positiveexamples. Region 218 (the relative complement of region 214 in region216, i.e., the portion of region 216 not contained in region 214)represents examples that are mislabeled as positive by the classifier(false positives).

The question is, how can a system be deployed that will perform well ondata that one does not know exists? One observation is that the operatorcan be ignorant of the distribution as long as he/she can correctlyclassify items on demand. The Active Labeling Exploration (ALE)algorithm is based on this observation. Labeling is the process ofclassifying data or patterns of data as belonging to a particular class,e.g., labeling “321 Market Street” as being part of an address. Activelabeling exploration is performed using a large set of unlabeled data(data on which the labeling process has not yet been performed), drawnfrom the true distribution. After each label (or few labels), aclassifier is retrained with the new label, and the large unlabeled dataset (e.g., tens or hundreds of millions of unlabeled patterns) isrescored. The system then selects which patterns to label next accordingto their scores. For this approach to work, one needs to solve the coldstart problem (i.e., find “seeds” of positives).

In one aspect, an integrated interactive labeling system includes alabeling component, a training component, a scoring component, asampling component, and a search engine component. The integratedinteractive labeling system may also include one or more other features,such as where the search engine is based on keyword search; the searchengine uses feature scores as a filter; training and scoring are doneautomatically without being triggered by the operator; or where scoringand sampling can be done asynchronously.

In another aspect, an integrated interactive labeling system includes alabeling component, a training component, a scoring component, and asampling component, where labeling can be can offloaded as a service andlabeling quality is measured by generalization gains. The integratedinteractive labeling system may also include other features, such aswhere multi-class labeling consists of multiple binary labeling; orwhere multiple samples are labeled approximately simultaneously usingsystem generated pre-labels, and a verification mode is included in thesystem to review approximate labels sorted by confidence.

Consider the example of building a classifier for web pages (the methodswould work for queries, images, or other types). Assume that a user hasaccess to 100 million web pages, referred to herein as the working set.These web pages may be biased by importance (e.g., high page rank) butthey are not biased by the nature of the classifiers intended to bebuilt. These pages are neither labeled nor ordered. Assume there is asmall and biased set of positive and negative examples and that aclassifier can be trained with these examples with reasonablegeneralization performance. (The “cold start” challenge for trainingclassifiers with small data sets with good generalization performance isdiscussed below.) The result of training is called a “scorer.” Scorershave version numbers that reflect the set they were trained on. As soonas the first scorer is available, “scoring” of the working set begins.This process requires a large amount of computing power. As a result ofscoring, the items can be ordered by their probability of being an “X,”where “X” is a class of the classifier to be built, i.e., where “X” is apositive example of the feature, or label.

FIG. 3 illustrates an exemplary plot 300 of the number of items 310versus the probability P 312 that an item is an “X.” As depicted in FIG.3, if the working set is sampled based on the scores produced by a givenscorer, the following observations can be made:

-   -   Labeling items around P=0 yields little value. There are many of        these items and it is already known that they are not of the        desired class.    -   Labeling items around P=1 yields a bit more value but the items        are very scarce. It takes a long time to find them (the whole        working set may need to be scored) and one has to dip into the        lower probabilities to find items to label. This assumes a        distribution like the one shown above (reverse P=0 and P=1 if        the distribution is lopsided in the other direction).    -   Labeling around P=0.5 can sometimes be costly and can yield        little information if the class boundary is inherently        ambiguous.    -   Labeling around P=0.75 finds a false positive in every 4 items.        Labeling in this region improves precision.    -   Labeling around P=0.25 finds a false negative in every 4 items.        Labeling in this region improves recall.

FIG. 5 illustrates examples of sampling distribution around theprobability of 0.25 and 0.75 respectively. To sample around 0.75, forinstance, one could put all the examples in 1000 buckets according totheir scores. The first bucket would have all the examples with scoresbetween 0 and 0.001, the next bucket all the examples with scoresbetween 0.001 and 0.002, and so on. Each bucket may then be assigned aprobability of sampling, such as for instance, the right side of FIG. 5.Examples with this distribution would result in a 25% rate of falsepositives.

The objective of ALE (Active Labeling Exploration) is to replace thelong and arduous “data-collection, labeling, training and tuning,deploying” cycle by an interactive loop that runs in minutes or seconds.

ALE has three processes that run simultaneously. These areSampling+Labeling, Training, and Scoring, as illustrated in Table 1:

TABLE 1 The 3 parallel ALE processes (sampling, training, and scoring)Filtering + Labeling Training Scoring Repeat: Repeat: Repeat: Improveprecision: If number of labels has If all items have Filter working setfor increased by factor f been scored by items with scores in since lasttraining then: latest scorer then: the neighborhood of Randomly splitworking Wait on new scorer P = 0.75 starting with set intoTrain/Validation/ else: newest scores. Test sets. Find an item whoseLabel these items. Train n Classifiers C₁ on latest score is oldest.Improve Recall: train set. Score the item with Filter working set forPick best classifier C₁ on newest scorer. items with scores invalidation set, produce the neighborhood of Scorer S_(τ) and report P =0.25 starting with Test error. newest scores. else: Label these items.Wait on new label.

The first process (Sampling+Labeling) is driven by the user. The user'stask is to improve precision and recall by labeling items selected bythe system. The user is oblivious to the training and scoring processes.From the user's point of view, the system simply chooses good patternsto label and the classifier increases its generalization capabilitieswith respect to an increasingly diverse set. The user may choose tolabel for precision or for recall, or that choice could be made by thesystem.

What happens behind the scenes is slightly more complex. When enough newlabels have been collected, a family of classifiers (of differentcomplexities) is retrained. The best classifier of the family becomesthe latest scorer. Scoring is an intensive computation process.

If the scoring from the previous scorer was not completed by the scoringprocess, the ongoing scoring is interrupted and the new scorer continuesscoring items starting with the oldest scores first. Depending on thetask and the size of the data, scoring could take minutes or hours.However, it is desirable that an operator should not have to wait forthe querying process: At any point of time, every item should have ascore (the scores may come from scorers with different versions), andall the scores should reside in memory. Since the querying is done by anindependent process (distributed on several machines), a full linearscan over all the scores should be done in sub-second time (assuming onebillion items and 100 machines). Training and scoring are runasynchronously by independent processes so they do not impact thequerying response time. The quality of selection of which item should belabeled next degrades if too few items have been re-scored since thelast scorer was produced. The ALE information flow is summarized in FIG.4. User inputs are denoted as “dashed” arrows. The system parameters aredenoted as dotted arrows. The data 416 is uploaded once. The labels 418are supplied by the user and provide semantic meaning to tokens that areidentified by the user during training.

Given new training data 420 and corresponding labels 418, the training422 produces a new scorer 424. The new scorer produces new scores 426which, after filtering 428, produce new training data 420. The filters432 may include dictionaries, discussed below, and may also includepreviously created classifiers.

The cycle continues until the operator decides that the scorer'sperformance improvements are no longer worth the labeling costs. Theresult is a new classifier 430.

The “Feature Functions” input 410 depicted in FIG. 4 is discussed belowin the discussion of Active Featuring. The purpose of the “ExplorativeQueries” input 412 depicted in FIG. 4 is for the cold start problem andfor exploration (repetitive cold starts) as described below with regardto cold start. The system's “Hyper-Parameters” input 412 has to do withautomatic regularization and is also discussed below.

Coming back to FIG. 3, in one embodiment, a system samples by filteringdata around P=0.75 to improve precision and around P=0.25 to improverecall. These thresholds are adjustable. As previously mentioned, FIG. 5depicts exemplary plots 500 of sampling distributions 510 as a functionof score 520. This alternating strategy has proven more useful than, forexample, sampling uniformly for all the scores between 0 and 1.

A. Interactive Problem Definition Refinements

The semantic meaning of the classification may change as a function ofexploration. ALE provides the flexibility to evolve the task while it isbeing performed. For instance, one may start with the goal of building a“Home page” classifier. But as the system discovers candidates such associal media pages, obituaries, events, and other pages centered on asingle individual during exploration, the definition of what is a homepage needs to be refined. This is easily done interactively whilerunning the ALE loop.

Building a classifier that performs well on data that is not known aboutwhen the task is started seems like an elusive goal. However, experiencehas shown that humans are trustworthy when it comes to labeling, eventhough they are ignorant when it comes to estimating the shape of adistribution. If humans are paired with a system that cleverly exploresthe distribution via exploration, very robust systems can be built. TheALE algorithm leverages both the scaling capability of computers and thehuman ability to provide semantic meaning through labeling.

Active learning has its challenges. Potential problems typicallyencountered in active learning algorithms include brittleness ofuncertainty sampling, model selection (adapting capacity to theavailable data), exploration, active featuring, disjunctive classes, andcold start. The ALE system described herein does not have thebrittleness of uncertainty sampling because it focuses away from thedecision boundary. Automatic regularization (model selection) and coldstart are discussed below. In a later section, active featuring and howit complements active labeling is described.

1. Lopsided Data and Reachability

Active learning is often viewed as a means to increase the efficiency oflabeling on a fixed size set with a fixed number of features. In atypical machine-learning setting, the goal is to improve accuracy. Theemphasis described herein is different in that it pertains to providingan exploration tool that will help the user add labels and features toproduce a valuable classifier or schema extractor. With Big Data withlopsided classes, only a small fraction of the data will ever beobserved and some nuggets of positive or negative may never bediscovered. When they are discovered, one may as well assume that thedistribution has changed. When the distribution is discovered on thefly, the basic assumptions on which machine learning relies—IID samplingfor train and test set—are violated. If the number of positives is T andthe size of the data is N, one cannot estimate recall without labeling anumber of patterns that is proportional to N/T. If T<<N, one may neverknow what the recall is. Learning convergence on the overalldistribution cannot be proven.

However, the overall classifier progress can be measured by means of ameasure called reachability. As defined herein, reachability is thenumber of positives that are classified as positive by the classifier.Let S be the set of positives estimated by the classifier (depicted inellipse 216 in FIG. 2):S={d:classifier output is positive}.

Let T be the set of true positives within the total data set (depictedin ellipses 214 in FIG. 2):T={d:d is positive}.

The reachability (R) is then the number of true positives within the setof positive estimated by the classifier (depicted as the intersection ofthe ellipses 216 and 214 in FIG. 2):R=|S∩T|.Reachability can be represented in terms of either recall or precision,as p=r|T|=φ|S|, where r is the recall of the classifier and φ is theprecision of the classifier. However, recall cannot be computed directlyin this case as the set T is not known. However, because T is fixed,reachability is directly proportional to recall. To increase recall ofthe classifier, one can instead increase reachability. The goals of aclassifier-building task can thus be formulated in terms of reachabilityand precision.

For example, let φ be the precision in S, i.e., the number of truepositives inside S (the intersection of the ellipses 216 and 214 in FIG.2) divided by the size of S:

$\varphi = \frac{{S\bigcap T}}{S}$and let r be the recall in S, or the number of true positives insideSdivided by the total number of true positives within the data set:

$r = {\frac{{S\bigcap T}}{T}.}$

One can compute an estimate φ′ of φ by labeling a random subset (or all)of the examples in S. The number φ′|S| estimates the number of positivesfound by the system. The recall φ′|S| cannot be computed because T isnot known. However, using an estimate φ′ of precision and an estimateφ′|S| that is proportional to recall, one can track the forward overallprogress of the system. At a fixed (or non-decreasing) precision,increasing the reachability increases the recall. Increasing theprecision at a fixed (or non-decreasing) reachability also increasesprecision for a constant (or increasing) recall.

There are other criteria that can also be used to measure progress. Forinstance, if most misclassified patterns that are discovered byexploration are ambiguous, then the classifier is doing well onprecision; if most misclassified patterns are easily handled by addingfeatures, then the classifier is exploring well.

a. Estimating Reachability

Reachability can be estimated based on the labeling strategy and thescore distribution of the unlabeled examples. As an example of this, letL be the set of labels and U the universe, and let S be the patternswith score ≧τ, a threshold that one sets (the entire region in ellipse216 in FIG. 2). Suppose the labeling strategy is defined by samplingaccording to a probability distribution conditioned on the score of thesample, i.e., one can compute for each document w E U, the probabilityof sampling p_(s)=Pr[w∈L|score(w)=s].

Letn _(s) =|T∩{w:score(w)=s}|be the number of positives with score s and letm _(s) =|L∩T∩{w:score(w)=s}|be the number of labeled positives with score s. The expectation for thenumber of labeled positives can be written as:E[m _(s) ]=n _(s) p _(s).Thus,

$n_{s} = \frac{E\left\lbrack m_{s} \right\rbrack}{p_{s}}$and since p=|T∩S|=Σ_(s≧τ)n_(s), the reachability can be estimated by thefollowing:

$\rho = {{\sum\limits_{s \geq \tau}^{\;}\;\frac{E\left\lbrack m_{s} \right\rbrack}{p_{s}}} = \left\lbrack {\sum\limits_{s \geq \tau}^{\;}\;\frac{m_{s}}{p_{s}}} \right\rbrack}$

The expectation can be estimated, for instance, by sub-sampling thelabel set.

Note: The estimate above can be done in many different ways by coveringthe interval [r . . . 1] by disjoint intervals. Not all decompositionsare equal in that some will have smaller error bars in the estimation.

With large data sets with lopsided distribution, improving accuracywhile assuming a uniformly sampled fixed distribution quickly reaches astate of diminishing returns. A more interesting problem is to view thedistribution as a moving target and involve the operator in tracking itdown. From a machine-learning theory standpoint, the two problems arevery different. Both engineering challenges (scaling, process, userexperience (UX)) and scientific challenges (exploration metrics,sampling strategies, revision training, among others) are encountered.The ALE algorithm addresses these challenges.

II. The ARCS (Automatic Regularization and Cold Start) Challenge

To work well, the ALE algorithm needs a few labels, a few features, andgood generalization properties of the early classifiers. This requiressolving two problems. First, both positive and negative examples areneeded, as well as startup features. This is the cold start problem. Itis difficult because in a lopsided distribution, the positive (or thenegative) examples might be extremely rare. For instance, if thepositives are less than one in a million, finding enough of them to getthe classifier going could be time-consuming (using random sampling).Without features or a working classifier, the ALE algorithm is of nohelp. The second problem is automatic regularization. With only a fewlabels, the classifier needs to be heavily regularized to avoidover-training. Regularization needs to be adjusted automatically so thatthe complexity of the algorithm can be matched to the increasing numberof labels. This could be called the “warm start” problem.

A. The Cold Start

The problem can be summarized as follows: Assume that a large databaseof generic examples of the same type T has been entered in the system,how does one distinguish them? To enable training, features (thatdistinguish the items from each other) are needed, and a means to findpositive and negative examples is needed. This problem is addressed byproviding modules that implement the IScorer <T> interface. The IScorermodules may be provided by the system or entered by an engineer (e.g.,when the data is collected). A module that implements that interface cancompute the function T→ScoreType, where ScoreType is a type understoodby the system (e.g., a floating point number between 0 and 1) for allitems in the database. The scores can then be computed on some or allthe items, and be queried and sorted. This allows the operator to findthe first examples of each class and to label them as such. IScorermodules can also be used as the first features of a classifier. The nextcycle occurs through the ALE algorithm.

If the data type is known a-priori, one can provide some standard systemfeatures that are specific to the data. The data-specific features caneven accept parameters from the operator. Such features can then be usedto distinguish, filter, label, or explore the data. For instance, if theexamples are web pages, a system IScorer <WebPageType> could be a modulethat computes the relevance of a web page with respect to a query. Thequery is the parameter of the feature and is provided by the operator.Once the query parameter is fixed, the module could run under the ALEalgorithm, thus evaluating every web page for its relevance. Suchimplementation is very inefficient compared to a reverse index, but ithas the advantage of being generic. Regardless of the data type T theoperator can provide the following:

-   -   A collection of N items of type T.    -   Modules (e.g., DLLs) that support the IScorer <T> interface.

The system does not need to understand the type T. The module could beparameterized outside the system (the provided dll contains the queryterms), or the system could provide means for the operator to set theparameters at run time (e.g., a query).

Given the ubiquitous need for text understanding, both a generic API(where the operator can input a module that implements IScorer <T>) andbuilt-in text features may be supported.

The definition of a feature may be confusing. The strict definition of afeature is a function whose output is used as the input of a classifier(or schematizer). Since a query is a form of classifier, a feature canbe used for querying. Since the output of a classifier can be used asthe input of another classifier, classifiers are themselves features.Features come from three places: built-in, operator-generated (withouttraining), and trained classifiers. Some built-in features can beparameterized by the operator (a hybrid). Some built-in features mayonly be available for certain data types.

For text features to be enabled, the type T of the items entered in thedatabase must support the IWordCollection interface. This interfaceallows the automatic build of a reverse index, and enables an efficientquery-like interface to the database. For databases that support thisinterface, the cold start problem is pretty much solved. When this isnot enough, and for databases that do not support the IWordCollection,the operator can provide additional modules that support the IScorer <T>interface. Once the system has IScorer <T> modules that are powerfulenough to effectively distinguish the items of the database, the coldstart problem has been solved.

B. AR (Automatic Regularization)

In interactive machine learning, the number of labels and featuresvaries over time, as labels and features are added. A classifier may be(re)trained successively with example counts of 10, 20, 40, 80, 160, asthe labels are coming in. For each training session, the optimalregularization will be different. It is desirable that the systemperform well even with very few examples because finding good examplesto label next will help the system learn more quickly. Since this willin turn enable the system to select which examples to label next, theeffect on generalization is compounded (each iteration increases thevalue of subsequent labels). The problem of performing well in thepresence of few labels is referred to herein as the “warm start”problem.

Requiring the operator to manually adjust regularization introducescomplexity and is unnecessary. For operators that are not familiar withmachine learning, the concept of regularization is hopelessly confusing.Fortunately, given labels and sufficient computational power, one cantrain a small family of classifiers of different complexity and usecross validation to determine which one generalizes the best.

For instance, if the task is to recognize handwritten digits, one couldhave two classifiers: a linear classifier and a state-of-the-art,four-layer convolutional neural network (both take pixels as input andoutput a probability for each class). The second classifier does muchbetter than the first when trained with 1000 examples per class, but itis comparatively terrible at scoring with fewer than 30 examples perclass. The linear classifier produces a very decent classifier andscorer when trained with as few as one or two examples per class. It isremarkably easy to automatically decide which classifier to use if theyare both trained and measured with cross validation. At the point wherethere are enough examples for both classifiers to be comparable, theoperator cannot easily distinguish which classifier is better (they havethe same generalization performance). This means that with propertiming, switching between classifiers with different regularization canbe done transparently, automatically, and without the operator everknowing.

Regularization is interpreted herein as constraining the family oflearnable functions to a subset of functions more likely to generalize.This can be done at the output level, at the architecture level, or atthe input level:

-   -   Output (labels generation): By generating or altering labels,        one can control what functions are realizable through training.        This constraint can be used for regularization. For instance,        instead of training on the set for which one has labels, a new        set is generated on which one provides labels using a-priori        knowledge. For web pages, this could be done expanding the        positive (respectively the negative) examples by using the click        graph to find similar pages and assigning them the same labels.        For images, this could be done by applying a transformation        (e.g., rotation or translation) and assuming that the resulting        images have the same labels as the image they originated from.        In both cases, the size of the set and the intensity of the        distortion can be adjusted. Each regularization value defines a        classifier. The winning classifier is picked using cross        validation.    -   Architecture: One can affect the family of learnable functions        by changing the learning algorithms (e.g., SVM, neural net,        decision trees) or the capacity parameters (weight decays,        training time, number of hidden units).    -   Input: One can change the input features. By changing the        discriminative power of the input features, different levels of        regularization can be achieved. For instance, one may have a set        of system features that compute various useful attributes of a        web page. By controlling when these input features are        available, one can automatically adjust capacity and        regularization. For an example of capacity induced by an input        feature(s), consider a feature (or set of features) that        measures the Log of the size of a web page. That feature may        have useful information but it would be a mistake to use it too        early. When the number of labeled examples is low, every example        may have a different length and it might be enough capacity to        perfectly classify the positive and negative examples on the        training set. The resulting scorer would then suggest labeling        pages based on the length of the page which is likely to be a        waste of time. By carefully selecting input features one can        construct a family of classifiers with different regularization        properties. This could be viewed as an example of        “anti-regularization.” Capacity is increased selectively.

III. The Scaling Challenge

The ALE algorithm scales in two different directions. One is the abilityto query, score, and train as a function of the number of items. Thesecond is the ability to scale with the number of classifiers andschematizers provided by contributors. An exemplary summary of this isillustrated in FIG. 6 and is generally referred to as scaling 600.

A. Scaling with the Number of Items

The leftmost column in FIG. 6 depicts a number of features as items 610(“ITEM 1” . . . ITEM n”), which represent scaling with the number ofitems. Scaling with the number of items is a computational challenge.For ALE to be effective, three kinds of computations are required:training, scoring, and querying. Training can be done on a singlemachine—a linear classifier can train on 1M+ examples in a fewseconds—or on multiple machines if multiple classifiers are trainedsimultaneously. Scoring is an inherently parallel task that can bedistributed on multiple machines. The typical “sampling” is most often afiltering operation by scores, e.g., returns items whose probability ofbeing X is between 0.70 and 0.80. Such filtering can be done withmap-reduce but it should be very responsive because the user of thesystem will be waiting for the next item to label. This suggests adistributed in-memory column store optimized for the filteringoperations.

B. Scaling with the Number of Classifiers

The three rightmost columns in FIG. 6 depict a number of classifiers 612(“C₁” . . . “C₂”) that are utilized to score each of the items 610.Scaling with the number of classifiers or schematizers is ahuman-computer interaction (HCl) challenge. A machine-learning expertcan build dozens of classifiers. Recruiting and retaining 100machine-learning experts is difficult and expensive. Building 10,000classifiers is impractical without changing the game. ALE allows acompany to quickly build 10,000+ highly performing classifiers and/orschematizers. To build classifiers at scale, three things are utilized:

-   -   Accessibility: Reduce the expertise needed to build classifiers.        No machine-learning background is necessary.    -   Motivation: Make building classifiers easy, interesting, and        magical.    -   Efficiency: Vastly improve the efficiency of building        classifiers in terms of operator's time.

Accessibility creates a large pool of people capable of buildingclassifiers. Motivation increases the motivation of people in that poolto build classifiers. Efficiency multiplies the productivity. Motivationis described last below, because it encompasses the other two from a UXperspective.

1. Accessibility

Ordinary people do not understand machine learning. If the systemrequires machine learning expertise, then the number of availablemachine learning experts becomes a bottleneck. To circumvent thisbottleneck, the interface may be restricted to only a few actions thatrequire no engineering skills. The interface has guardrails thatdiscourage behaviors that are not compatible with improvinggeneralization. The actions of the operator may be limited to thefollowing:

-   -   Creating a new Classifier/Schematizer task    -   Labeling    -   Featuring:        -   Creating a dictionary of terms        -   Finding and selecting features from existing classifiers.

Note that “training,” “scoring,” and “regularizing” are not standardactions. These computations happen implicitly and transparently. As aresult of these activities, the operator will observe a change in thetypes of errors presented to him or her. This is both an effect ofimproving precision, and what will contribute to the next precisionimprovement. Similarly, new patterns will be extracted for labeling.This is both an effect of improving recall (and in some case precision),and what will contribute to the next recall (respectively precision)improvement.

There will be some progress metrics like precision or estimators of thenumber of positive or negative examples found by the system, or the rateof improvement around the classifier's class boundaries. Metrics will bedisplayed with errors to encourage a data-focused approach to training.The use of automatic features is limited to encourage the operator toprovide valuable concepts and labels instead. To explicitly discourageover-training, the test set is constantly recycled so there are nobenefits to fixing a single error, but rather benefits manifest byfixing categories of errors. The operator may have no machine learningbackground to start with, but the UX is optimized to train him/her toimprove generalization.

2. Efficiency

The efficiency could be measured in how much energy it takes for anoperator to create a classifier with a given precision and recall. Thisdefinition can be problematic because one does not know what recall is(on a large data set with few positives, it may be very difficult toknow how many positives there are). Even the class definition may not bewell defined until some examples are discovered: Is an obituary a homepage? Is a cocktail mix a cooking recipe? These questions are likely toarise only during the building of a classifier. Two assumptions aremade: First, assume that it is possible to compare two classifiers andunambiguously determine that one is better than the other (betterrecall, better precision). Second, assume that improving a classifiermay include having multiple “revision cycles.”

A revision cycle is defined as an operator input that is a function of acomputation, followed by a computation that is a function of theoperator's last input. At each cycle, the problem is revised in at leastone of three ways: the class definition changes, the distribution ofexamples to label changes, or the input space changes. These quick andtargeted revisions of the problem are different from traditional machinelearning. In traditional machine learning, the distribution is usuallyconstant (optimization of the features on a fixed training set). Even inactive learning papers, progress is measured on a fixed distribution:the emphasis is on reducing the number of labels to achieve a givenerror rate on a fixed distribution, rather than exploring anddiscovering the distribution. A true cycle (or a revision) typicallytakes months. In contrast, the ability to have tens or hundreds ofcycles in a single day radically changes the efficiency of classifierbuilding. The cycle effects are compounded. For instance, when aclassifier becomes better as a result of a cycle, it becomes better atfinding positive or false positive for the next cycle.

In the system described herein, cycles come in three flavors: activelabeling exploration (ALE), active featuring, and dictionary refining.The first, ALE, has been discussed in a previous section. Activefeaturing is the activity of creating a feature for the purpose ofallowing a classifier to discriminate between positive (respectivelynegative) and false positive (respectively false negative). It is akinto curing the classifier of “color blindness.” Active featuring is theobject of the next section. The last form of cycle is specific to thedefinition of a concept. A concept is defined herein as a group ofwords, or a dictionary, that defines a concept when the words are viewedas a group (e.g., the concept of car brand is defined by the list ofwords “Honda,” “Ford,” “Peugeot,” and so forth). The cycle of dictionaryrefinement results from an operator giving positive and negativeexamples, and computation provides concept generalization candidatesfrom these examples. The operator can then correct the generalization(by striking out words or adding new ones) and so on. The dictionaryrefinement cycle is described in a later section.

Each cycle requires heavy computation followed by targeted semanticinput from the operator. This might be inefficient from a computingpoint of view, but it is efficient from the operator's view point. Theoperator only needs to work when the system fails to generalizeproperly. The overall architecture (active labeling and activefeaturing) is organized to surface these failings early.

3. Motivation

Accessibility opens up the number of people that could writeclassifiers. However, that is not enough. Some sort of “magic” isnecessary to generate viral adoption. Current machine learning tools aredesigned by engineers for engineers. They are devoid of magic. Thissection is about increasing motivation to build classifiers by carefullydesigning the UX.

To most people, machine learning is complicated and mysterious. Buildinga user interface that allows machine-learning-illiterate operators toteach a machine learning system to perform recognition andschematization tasks is a challenge. Described below are simple UXprinciples, which are designed to make the system understandable andtrustworthy:

-   -   Transparency: The state of the system is accessible and directly        actionable by the operator (corollary: there are no hidden        states/variables).    -   Responsiveness: Every operator action produces an immediate and        visible effect.    -   Progress: There is always a clear action that moves from the        current state closer to the desired state.

The transparency principle makes the system less mysterious anddangerous. The responsiveness principle allows the user to haveimmediate feedback on their action and learn the “derivatives” of theiraction. The progress principle identifies the direction to follow toreach the desired state.

To enable learning, labels and features are needed from the operator. Ifthe labels and/or features change the state of the system, the firstprinciple implies that the labels and features should be accessible andeditable. This has several implications:

-   -   Labels entered by the operator may be viewed and edited. Undoing        is a trivial operation.    -   Features entered by the operator may be viewed and edited.        Undoing is a trivial operation.    -   System-generated labels and features are highly discouraged.        They compromise transparency.    -   The system's performance should be independent of the order in        which labels or features are entered. Order dependence is        unlikely to be easily viewable and actionable.    -   The same set of labels and features should always yield the same        result. Learning is a semi-deterministic function. If the        learning algorithm is sensitive to slight change of features,        the first principle is somewhat violated (the operator may not        be able to distinguish the input variations).    -   The data should be “pickled.” It is not desirable, for instance,        for links in a web page to have dangling pointers that could        change the behavior of the system when the links are out of        date.

The first principle will be violated occasionally, but hopefully thiswill not affect the trust of the operator in the system. For instance,certain features may be automatically provided as system services, likesynonyms, misspellings, click graph, and so on. One could freeze thesefunctions, but it might be better to freeze their semantics and let thefeatures be updated regularly and transparently (with a small cost topredictability). If a classifier learns to depend on the semanticmeaning of the feature, then regular updates of the feature will improvethe classifier. Surprisingly, one may even introduce artificial noise inthe system to drive the concept that machine-learning only providesstatistical guarantees, not single-pattern guarantees. The resultingnon-determinism does not affect the overall performance, but itdiscourages novice users from over-training.

The responsiveness principle allows users to quickly learn how tooperate the system (feedback). It also produces rewards by translatingactions into progress. Every label and every feature should create avisibly better classifier. This is difficult for three reasons:retraining a classifier after every action is expensive. Rescoring allitems with every new classifier is even more expensive. And finally,many operator interventions may be necessary for the classifier to showa visible and statistically significant improvement. If explorationchanges the distribution significantly, the global metrics may beaffected in unpredictable ways. These challenges are compounded by thefact that retraining and rescoring should be transparent. Withoutinfinite resources, the immediacy and visibility aspects of the designprinciple will be compromised (for instance, by not retraining on everyoperator input). This can be alleviated by increasing the number ofresources dedicated to training and scoring, retraining at regular andfrequent intervals (e.g., every 50 labels), and taking advantage ofpartial scoring (in the ALE algorithm, the query/filtering returnswithout waiting for every item to be scored). Unsurprisingly, theresponsiveness principle is best addressed by increasing the number ofresources (compute power) and clever management (partial computation).

a. Error Categorization

The progress principle implies that the operator always knows when thejob is done and what to do to make the system better. Neither of thesetwo things is simple. When should one stop improving a classifier? Howdoes one know how to improve a classifier? To help answer this question,the errors made by the system are categorized in three buckets:

-   -   Ambiguity errors: Errors for which labelers cannot agree on what        the label is.    -   Color-blindness errors: Errors for which the system does not        have the necessary input information to distinguish the pattern        from other patterns that belong to the wrong classes.    -   Ignorance errors: Errors for which the system has the input        information to distinguish the pattern from a pattern of the        wrong class, but insufficient label information to be able to        learn the relationship between the input and the pattern class.

This classification of errors assumes that the system has the capacityto learn the problem and is properly regularized. This assumption doesnot constrain the user interface. If the system did not have thecapacity to learn the problem one would have errors of the type:

-   -   Low capacity error: Errors for which the system has the        necessary input and necessary labels to classify correctly but        cannot do so because of low capacity.

One need not be concerned about this case because the learning problemcan be simplified by adding good features, and for most machine-learningalgorithms adding features increases capacity. Therefore, one could onlyencounter this error as a result of a feature limitation, which wouldmake it a “Color-blindness” error. Conversely, there could be a casewhere the capacity is too high. In this case, the symptom would be thata large number of “ignorance errors” would be observed even after addinga large number of labels.

The choice of machine learning algorithm, the expressiveness of thefeatures, and the quality of automatic regularization affect how long ittakes to learn and what is the best result that the system can achieve.However, these can be modified and improved without having to redesignthe user interface.

The error categorization helps us address the progress principle, e.g.,the first type of error (ambiguity) suggests the desired state: If themajority of errors fall in the “ambiguity error” category, the operatoris done. The system has little hope of surpassing the operator. If alarge fraction of errors are due to color blindness or ignorance, theoperator knows what to do: Color-blindness errors are fixed by addingfeatures that distinguish positive from false positive or negative fromfalse negative. One can design an interface to enable this (nextsection). Ignorance errors are fixed by adding labels. At any point intime, the system can suggest which type of errors should be addressedfor maximum efficiency. If the training and testing error curves of thelearning algorithm are close, more features are needed. Otherwise, morelabels would be more effective.

b. Immutability

For the path from the present state to the desired state to beunambiguously clear, one should guarantee that progress is always goingforward. This should earn the operator's trust. It requires someprecautions. Once a classifier is trained, it can become a feature. Onceit becomes a feature, it is not allowed to be retrained as part of alarger model. Retraining a feature as part of a larger classifier couldhave several negative consequences: First, it could change the semanticmeaning of the feature. This could cause operator confusion and backwardprogress on other features. Second, the capacity of the feature when itwas trained may be much higher than the number of labels available onthe larger classifier. The unexpected infusion of capacity could cause abackward step. Machine-learning experts may object that freezing theparameters might be suboptimal from a machine-learning standpoint.However, as described herein, system stability and predictability trumpoptimality.

Progress can be measured with metrics. For instance, the number ofpositives found by the classifier multiplied by the precision can yieldan estimate on the number of positives reached by the system. Thismetric is proportional to recall. The precision progress per label madeon the boundary (e.g., all the patterns that had a probability of beingX between 0.25 and 0.75) is an interesting measure of efficacy.

Motivation comes from magic. The magic comes from the system generatingthree things:

-   -   Empathy: The operator should understand the errors made by the        system. Discouraging system-generated labels and features (e.g.,        “bag-of-words”) keeps the system interpretable. Color-blindness        errors should cause the operator to be eager to provide new        features. Ignorance errors should cause the operator to be eager        to provide more labels. The system errors should be welcomed as        useful. The transparency, responsiveness, and progress        principles all contribute to making the system behave as a        gifted learner.    -   Surprises: The system should impress the operator by how it        pushes the boundaries of what it has been taught. Its errors        should zoom in on the missing features/concepts. Its requests        for labels should challenge the operator to discover unforeseen        example types and to redefine the class concept. The ability to        surprise comes from 1) the streamlining of the concept features,        and 2) scoring very large data sets.    -   Efficiency: With the system doing extraordinary computation for        each operator input, the classifiers should make progress very        quickly.

With accessibility, efficiency, and magic, building classifiers willproduce both value and wonderment. This will allow classifiers andschematizers to be built at scale.

IV. Active Featuring

A. Featuring

A common activity in machine learning is to search for the rightfeatures. People typically do this in an ad hoc way: adding a featurevia programming or processing the data, starting a completelyindependent process to retrain the system on the modified data, thenthey look at the errors, and so forth. None of it is typicallyintegrated in a system where errors can be browsed and features can beshared and searched without exiting an application. As described herein,active featuring enables interactive feature creation, editing, andrefinement.

Some methods for helping users select features to fine tune a system'sperformance either select features automatically (e.g., Bag of Words) orselect from a number of pre-existing features (model selection, featureselection, and so forth). Active featuring encourages the user tointeractively create useful features, and the complexity of themachine-learning algorithm is kept to a minimum. The idea is that it isbetter to fix errors interactively by adding features and labels than itis to avoid errors by adding complexity in the machine-languagealgorithm and the feature selection. Complex learning algorithms and alarge number of features are likely to work well in an initial phase,but may quickly leave the practitioner with a complex system that noobvious decision can improve; in which case removing errors isprohibitively difficult. In contrast, an interactive loop that allowsthe user to add features and labels while relying on a simple learningalgorithm may yield a more actionable system. When the user hascontributed every label and every feature, the errors may become clearerand easy to fix (either by creating/editing/refining a feature or addinglabels).

As described herein, features can come from 1) pre-existing systemfeatures, 2) pre-existing features created on the system by other users,and 3) features created on the fly by the user. For 3), two categoriesare distinguished: 3a) features that are themselves classifiers andentity extractors built interactively using active labeling, and 3b)word features that are created by entering a list of words (also calleda dictionary) to capture a “concept.” For instance, a list of months(January, February . . . ) captures the concept of “Months.” The wordsin a dictionary together form a feature that can be utilized bycomputing statistics between a document and the given dictionary (howmany words in the dictionary appear in the document, how many distinctwords of the dictionary appear in the document, and so forth).

In one aspect, an integrated active learning system includes a browsingcomponent, a training component, a scoring component, and auser-operated feature-creation component. The integrated active learningsystem may include one or more other aspects, such as where searchablefeatures are classifiers created within the integrated active learningsystem, a search for features is guided by labels and classifier scoresand validated by the operator, classification errors are organized anddisplayed to suggest and fix classification feature-blindness, orfeatures are created and shared by multiple operators and stored on acommonly accessible system.

In another aspect, an integrated system includes a browsing component, atraining component, a scoring component, and a feature-creationcomponent based on user-provided dictionaries. The integrated system mayinclude one or more other aspects, such as where the number ofparameters for the feature dictionary is independent of the number ofwords in the dictionary, or the user can specify whether the parametersare common to the all the words in the dictionary or individual to eachword in the dictionary.

By design, the interfaces described herein are agnostic to whichlearning algorithm is used. In this section, the creation of features isdiscussed.

Consider an input space D. For each data item d∈D, compute aclassification value y from an output space O. To do this, aclassification function g is used, which maps a point d∈D and aparameter vector w of the parameter space W to a vector y∈O. The spaceof such functions is denoted G:G:D×W→0g:d,w→g(d,w)=y

For instance, the data space could be the space of web pages, theparameter space W could be a vector of real values computed by a machinelearning algorithm, and the output space O could be a number between 0and 1 representing a probability of being of the desired class for eachweb page. One problem with this formalism is that the space D may beextremely complex and the set of function G that maps D×W to O could betoo large to be trainable from a few labeled examples. For instance, ifd is a web page that is truncated to, at most, 100K words, then given adictionary of, at most, 10M words, the input space's dimension couldstill be 10¹². To simplify the problem, the space D is projected to alower dimensional space I, which herein is referred to as the “featurespace.” The set of projections is denoted F. The projection ƒ∈F: D→1 isfixed during the training of the parameters. One can now restrict thelearnable function from G to a space G′ that verifiesG′(ƒ,h)={g∈G|3w∈W,g(.,w)=h(ƒ(.),w)}

where h is a function that maps the feature space and the parametervector to the output. The space of function H:I×W→O is determined by thelearning algorithm. The feature space I induced by F and the learnablefunction space H are chosen to make the learning of the parameters weasier and require as few examples as possible. For instance, for webpage classification, the feature function ƒ could be extracting the termfrequency ƒ_(i) normalized by the inverse document frequency (tf*idf)for the k most relevant terms (e.g., k=1000) to the classification task.In other words, given a web page of data d, the featurization functioncomputes a feature vector x=ƒ(d)=(ƒ₀, ƒ₁, . . . , ƒ_(k)), where ƒ₁ isthe normalized number of occurrence of term i in document d and ƒ₀=1.The classifier could use logistic regression to compute theclassification function:h(x,w)=logistic(w ^(T) x)

Once ƒ and h are defined, traditional machine-learning algorithms can beused to estimate the parameters w using a set of training examples(x_(j),l_(j)) where x_(j)=ƒ(d_(i)) and l_(j) are respectively the jthfeaturized example and its label in the training set. Of interest hereis a scenario where an operator building a classifier is allowed tocontribute both labels l and feature function ƒ. FIG. 7 illustrates anexemplary information flow 700 that represents a classification function710 as the composition of a featurization function ƒ (item 712) and afunction h (item 714) that is trainable (item 716). The operator caninput both features 718 and labels 720 in order to affect theclassification function 710.

In previous sections, active labeling was discussed as a procedure forexploring and improving the classification space. Following is adiscussion of the input side equivalent of active labeling: “activefeaturing.”

B. Color Blindness

There is a significant amount of literature related to the automaticselection of features. It is sometimes referred as “feature selection.”The implicit goal of automatic feature selection is to improvegeneralization given a training set. The goal as described herein isdifferent: Provide the operator with a means to contribute thefeature-equivalent to labels. This is following the principle describedabove that humans should contribute semantic meaning and computersshould provide scale. In the previous section, three classes of errorswere distinguished: ambiguity, ignorance, and color blindness. Ambiguityerrors are beyond fixing (they come from the operator or the intrinsicnoise of the problem). Ignorance errors are fixed by adding labels.Color blindness errors are fixed by using “color filters,” or followingmachine-learning terminology, by adding features that allow the systemto “see” the difference between members of one class and members of adifferent class.

The interface for featuring may be problem specific. For instance, afeature could be a function of pixels in image recognition, a functionof words in query classification, or a function of cepstral coefficientsin speech recognition. The operator is not required to understandpixels, cepstra, or bag-of-words to build a classifier. But there is aneed for someone that does to set up the problem. Two kinds of users aretherefore distinguished:

-   -   The Engineer: This user can program and knows the basics of        machine learning. The engineer is responsible for doing the        following four things:        -   Uploading the data to the system.        -   Providing a generic featurizer that converts the data into a            set of features that the training algorithm can consume.        -   Providing a visualizer that converts the data into something            that can be displayed by the system.        -   Selecting the training algorithm and set its            hyper-parameters if required.    -   The Operator: This user has no engineering or machine-learning        background. The operator is responsible for creating and        training classifiers and schematizers.

Once the engineer has set the problem, operators can build multipleclassifiers and schematizers. At the beginning, the inputs of the newclassifiers are the generic feature(s) provided by the engineer or thesystem. Once some operators have built and trained some classifiers,they can be frozen into features. As described above, features areimmutable. These new features then become available for input forbuilding higher level classifiers, thus creating an eco-system.

An operator could build a classifier by selecting a few features andthen turning to the ALE algorithm to add labels. Indeed, many systems inmachine learning operate from a fixed set of features. For big data withlopsided distribution, however, one does not know a-priori whichfeatures will be needed. The need for new features is likely to manifestitself through exploration. For instance, while building a cookingrecipe classifier, it may be useful to have a feature that identifiesingredients found in African recipes. The operator may not have knownabout the existence of African recipes and their specific ingredientsuntil they are discovered through exploration. When building a cardetector, having a wheel (or circular shape) detector as a feature wouldmake the segmentation problem a lot easier. The operator may not haveknown that the problem was too hard without this additional featureuntil she attempted to build the classifier. To address this limitation,the operator should have the flexibility to add features as needed. Inactive featuring, an operator inspects the errors made by theclassifier, and searches for features that enable the classifier toeasily distinguish portions of positive from false positive orconversely, portions of negative from false negative. In other words,the operator is looking for “color blindness” on the part of theclassifier. Once color blindness has been identified, the operator canfocus on creating a feature to provide a “color filter” in order to curethe blindness.

The active featuring process is a loop in which the operator inspectserrors, creates features and/or edits/refines features, retrains thesystem, and re-scores the labeled examples for the next iteration.However, creating new features often requires new labels. So the activefeaturing process is itself embedded in a large loop, which involvesboth active featuring and ALE, herein referred to as the RAFALE (RepeatActive Featuring Active Labeling Exploration) loop. This is summarizedin Table 2:

TABLE 2 RAFALE (Repeat Active Featuring Active Labeling Exploration)Loop RAFALE Active Featuring Feature Creation Repeat: Repeat: Repeat:Active Featuring Inspect Errors Search existing features Active LabelingCreate and Add features Create new classifier Exploration (and/or Createor Refine Create domain specific existing features) features Train Scorelabeled set

To create a feature, the operator has 3 choices: 1) find a systemfeature or a feature created by another operator (using a searchengine), 2) create a custom-made classifier to implement the desiredfeature, or 3) create a domain specific feature. The first choiceleverages the power of a community. The second choice leverages theability to quickly create a classifier using an integrated tool. Thisability is not generally available because labeling, training, scoring,and featuring are typically done with different tools and oftendifferent people. The third choice depends on the domain. An interfaceis described below for entering domain-specific features for itemscontaining lists of words.

C. Words and Dictionaries

In many applications of machine learning, the basic features are words,which may include individual words, stemmed versions of the words (e.g.,words in which inflection denoting plural, past tense, and so forth havebeen removed) as well as n-grams (sequences of consecutive words orstems). Often, the representation of choice is bag-of-words. In thisrepresentation, the features are based on the frequency of each word(TF: term frequency) in a document with some normalization (IDF: inversedocument frequency). While it is possible to get good results with thesefeatures, they lack the power of expressing and generalizing toconcepts. For instance, while it is possible to count the frequencies ofHonda and Toyota in a document, it is preferable to have features thatgeneralize to all the car brands.

Described below is a tool for interactively building dictionaries thatrepresent concepts, for the purpose of being used as features forclassification or entity extraction. Concepts are created interactivelyas part of the active featuring loop to address the errors made by themachine-learning algorithm.

In this section, the items in a database are assumed to be documentsmade up of words. However, the concepts of documents and dictionaries asdescribed herein are not limited to the use of words, and may includeother kinds of data. The assumption is also made that the words inside adocument have no inter-relationship (bag-of-words model), and a TF*IDFvector representation is used as the basic feature vector. Before thenotion of dictionaries is introduced, this representation needs to beexplicitly described.

Assume that C is a collection of documents in the database, and T is aset of terms that are relevant for the classifier that is to be built.For instance, T could be the set of all the words that appear in thecorpus C. For each document d and term t, the term frequency tf (t,d)can be computed, which is the number of occurrences of word t in ddivided by the length of the document. Intuitively, the term countrepresents a direction in the semantic space of words. It is normalizedby the length of the document to be invariant to verbosity. All theterms do not carry the same amount of information. In particular, thenumber of bits communicated by the statement “the term t occurs indocument d” is given by the formula:

${{idf}\left( {t,C} \right)} = {\log\frac{C}{\left\{ {d \in {C\text{:}t} \in d} \right\} }}$where |C| is the cardinality of C and |{d∈C:t∈d}| is the number ofdocuments where the term t appears. This quantity is also called theinverse document frequency. For each document d, the tf*idf featurevector representation of document d is defined asx(d)=(tf(t,d)*idf(t,C))_(t∈T)and has two useful properties: it is invariant to the length of thedocument and the variance of each word feature is proportional to itsinformation content. Table 3 summarizes how the tf*idf representation iscomputed:

TABLE 3 Counts of each word in each document Doc word1 word2 word3 word4. . . Length doc1 0 2 0 1 . . . 100 doc2 1 0 0 0 . . . 147 doc3 0 0 0 1. . . 1234 . . . . . . . . . . . . . . . . . . . . . idf 3.1 2.3 6.8 0.5. . .

The tf*idf value is computed by dividing the counts by the documentlength (last column) and multiplying the result by the inverse documentfrequency (the last row). The resulting row vectors are the featurerepresentations of each document.

If logistic regression is used for classification, it is desirable toregularize the weights and to not rescale the input to adjust theirvariance. This is because in the word space, the problem is veryhigh-dimensional and there are very few labels. For logistic regression,the classification function is:

$y^{p} = {{h\left( {x^{p},w} \right)} = {{logistic}\left( {{\sum\limits_{i}\;{w_{i}x_{i}^{P}}} + w_{0}} \right)}}$

where x^(p) is the feature representation of pattern p, y^(p) is theoutput of the classifier and i is an index over the terms of T. Theobjective function is:

${E(w)} = {{\sum\limits_{p}\;{{Log}\;{{Loss}\left( {{{l{ogistic}}\left( {{\sum\limits_{i}\;{w_{i}x_{i}}} + w_{0}} \right)},l^{p}} \right)}}} + {\lambda{w}^{2}}}$where l^(p) is the label for pattern p, and λ is a regularizationparameter. One should realize that |T| may be several orders ofmagnitude larger than the number of labels. The regularizer could be|w|² or |w|. If there were no regularizers (i.e., λ=0), the idfnormalization could be absorbed into w during training.

If each word in a given dictionary is given its own weight, then thesystem becomes more equivalent to bag-of-words. The idea is that anoperator could communicate invaluable information to the classifier byspecifying features that capture semantic meaning. The operator isallowed to single out words in small groups and the individual smallgroup can still have a shared weight, which might be important foradditional regularization constraints. If all the words in thedictionary share the same parameter, then their semantic is also shared.

For instance, when building a classifier for automotive, a feature couldbe a dictionary of all the car brand names, such as {“Toyota,” “Ford,”“Peugeot,” . . . }. Another interpretation of featuring is that theoperator is “tying” the parameters of the model. Imagine that the tf*idfrepresentation is still being used, but that the parameters for theterms in the dictionary {“Toyota,” “Ford,” “Peugeot,” . . . } are tiedto a common value. The generalization value is immediate: if thedictionary contains rare car brands (e.g., Maserati), the classifier canperform well on documents about that car brand even though no labeleddocument in the training made any reference to cars of that brand. Forexample, if both the words “Honda” and “Maserati” appear in a car branddictionary and if the word “Honda” appears in many training examples,the system will be able to generalize to “Maserati” even though noexamples of “Maserati” appear in the training set.

It is possible to have a system that is in between having a weight perword in a dictionary, and a single weight for the whole dictionary. Thisis done by having a weight per word, but by constraining the weightswithin a dictionary with a regularization constraint. As soon as adictionary is entered, the corresponding weights have a common sharedvalue (many gradient descent learning algorithms generalize easily tothe weight sharing concept). The idf scaling of the term frequencycontribution is desirable because terms that carry less informationshould not have an equal weighting on the value of the shared weight.After scaling, all the parameter w₁ contributions are comparable. Theweight sharing constraint can be relaxed and one can induce groups ofweights to be similar. As one example, one may constraint a group ofweights to be close to their average. In that case, a regularizer may beused to tie the group of weights to their average, such that the weightsof the words within the dictionary are constrained to not deviate toomuch from their average. An exemplary regularization constraint couldhave the form:

$\gamma{\sum\limits_{\;{c \in E}}^{\;}\;{\sum\limits_{j \in {Jc}}^{\;}\;{{w_{j} - \overset{\_}{w_{Jc}}}}^{2}}}$

where E is the set of dictionaries, J_(c) is the set of indices for theterms in dictionary c, w_(Jc) is the average of the parameters for theterms indexed by J_(c), and γ is a regularization parameter. In thissetting, the weights corresponding to a common dictionary are tied by aregularization constraint. For a large value of γ, the constraint abovestrongly enforces near equality which is equivalent weight sharing, orequivalent to having one weight per dictionary. In all likelihood, theregularizer γ will be larger than λ because the prior knowledgecommunicated by the operator is much stronger than the prior knowledgethat most w_(i) are small.

The weight for each dictionary can be scaled as a function of documentfrequency or dictionary size prior to applying the regularizationconstraint, in order to keep each weight on comparable scale. In effect,in the previous example, this allows the word “Honda” to transfer itsknowledge to the word “Maserati” through the regularization constraint,but it still allows the word “Maserati” to have a different weight ifthere is enough “Maserati” data to pull the weight in a differentdirection.

D. Interactive Concept Editing (Active Conceptualizing)

As an example of creating a classifier, assume the goal is to create aclassifier for “home pages”:

-   -   Positive: Personal page, social media pages, academic pages, and        so forth    -   Negatives: search results, directory, events, obituaries,        companies, commercial pages, and so forth    -   Ambiguous: Fictional people, famous dead people, resumes, and so        forth.

The dictionaries might be created in this order (it is hard to guessuntil the tool is built):

-   -   Home page: [“Home page”, “Bio”, “Resume”, “Hobbies”, “Facebook”,        and so forth]    -   Contact info: [“Contac information”, “Address”, “Phone”,        “email”, and so forth]    -   First names: [“John”, “Steven”, and so forth]    -   Last names: [“Smith”, “Dupont”, and so forth]    -   Search/directory: [“Search”, “Login”, “Signup”, and so forth]    -   Obituary: [“obituary”, “passed away”, “died”, “beloved”, and so        forth].

The first four dictionaries help find positives (remove falsenegatives). The following two reduce the number of false positives. Thisprocess is highly interactive. It is difficult to know which dictionarywill be useful without building the classifier. The user may decide tocreate a classifier for obituaries or for events on the fly. Thisprocess is recursive. The features/classifiers created on the fly arenot required to be good. To be useful, they only need to be better thanchance and bring new information.

1. Issues

-   -   If the number of dictionaries is large, one may think that        featuring is similar to creating rules and exceptions, in the        tradition of “expert systems” and old style “AI.” However, there        are three things that may be taken into account:        -   First, dictionaries are merely features or filters. How they            are combined is completely left to the machine-learning            algorithms. From the user's viewpoint, there is no explosion            of complexity. The featuring task is merely to provide the            system with the means of distinguishing positive from false            positive or negative from false negative. The complexity of            adding the 1^(st) or the n^(th) dictionary is the same. The            operator is providing sensors, not rules.        -   The difference between building classifiers efficiently and            inefficiently is likely to come from keeping the            dictionaries “clean” in terms of semantic meaning. For            instance, in the Home Page example above, it would be a bad            idea to mix the dictionary of home page cues with the            dictionary that detects whether there is an address in the            page. This would reduce compositionality. While adding a few            address terms to the first dictionary is better than not            having an address dictionary, having two dictionaries for            two semantic meanings is far better. It allows the system to            weight their influence differently and it makes debugging            and reusability of feature-dictionaries much easier. The            “sensors” should be as orthogonal and pure as possible.            Maintaining clean dictionaries may also make them better            suited for later reuse. Pure dictionaries are easier to            understand by other humans and more likely to be helpful to            other classification problems.        -   The optimization is non-parametric. This means that through            cross validation, the capacity of the system is adjusted            automatically to match the amount of data available. The            system should perform as well as any currently in-use system            based on bag-of-words, with the same amount of data. The            additional information provided by a feature could be very            helpful if it saves the operator from entering thousands of            labels.    -   The dictionary editing could be useful for any system that uses        bag-of-words. This may work well for data where the relationship        between the words is hard to extract, e.g., queries, ad text,        user product descriptions, or free flow text. For documents that        have a schema structure, such as recipes, job descriptions,        products, and forums, the positional information and the        relations between the words is important. This will be the        object of the next section.    -   Entering dictionaries could be a tedious task. For instance, the        dictionary of first names and last names in the previous example        would have many entries. The dictionary for cooking ingredients        extracted from freebase had 1,709 ingredients at the time of        this writing. Fortunately, the process of entering dictionaries        can be automated. This is the object of the next sub-section.

In one aspect, an integrated system includes a component with means todisplay training patterns, a training component, a scoring component,and a dictionary-editing component. The four components are used in anactive featuring loop. The dictionary-editing component contains aninteractive loop to allow the operator to edit and refine conceptscharacterized by lists of words or group of n-grams.

In another aspect, a dictionary feature is provided in which each wordor n-gram in the dictionary has its own weight. The weights of thedictionary can be rescaled by a function of frequency and dictionarysize. The rescaled weights are tied by a regularization constraint thatpulls the weights of the words that have less training data toward adefault value determined by the words that have more training data.

In another aspect, a dictionary interface is provided for constructingthe features of a classifier or entity extractor. The interface allowsconcepts, defined by a large list of words or n-grams, to be specifiedinteractively by providing a small list of positive or negative word orn-gram examples. At each iteration, the concept list is automaticallyexpanded using a collection of algorithms and editing by using input.

In another aspect, a dictionary interface is provided for constructingthe features of a classifier or entity extractor. Each feature iscomposed of a list of words or n-grams. The interface allows theoperator to specify options on how the feature is computed. Thegeneralization effects of various options alternatives are computed on avalidation set and previewed.

2. Dictionary Creation

A dictionary can be viewed as a concept. As a concept, it can begeneralized. When an operator types a few positive examples for adictionary, the system can provide suggestions for possiblegeneralizations. If the generalization is too aggressive, the operatorcan provide feedback by adding negative examples. This becomes aniterative process where the operator provides positive and negativeexamples to guide the system toward the correct generalization of atargeted concept. This follows the philosophy described above: theoperator provides semantic meaning, and the system provides computationat scale to refine the meaning. This section is divided into two parts:A user interface for active conceptualization, and a collection ofalgorithms for concept generalization.

a. Active Conceptualization Interface (ACI)

The goal of the interface is to help the operator communicate conceptsto the system in order to create dictionaries. The dictionary creationand editing can be done in a feedback loop where the user provides alist of positive examples. FIG. 8 illustrates an exemplary interface 800suitable for use with active conceptualization and dictionary editing.When the operator clicks on the Refresh button 822, the system generatessuggestion sets 810, such that each suggestion set 810 is a new list ofwords meant to generalize the concept implied by words entered by theuser. Each suggestion set 810 is generated using a different algorithm.The user can then add more words as positive examples 816 or negativeexamples 818 by typing them, or by clicking or dragging them from aproposed list.

Words from the suggestion sets 810 may be added to a working set 812 byclicking on a corresponding Add button 814. Words clicked on, orselected, in the suggestion sets 810 are added to positives 816. Wordsselected in the working set 812 are added to a negative set 818. Othermethods for adding positives 816 and negatives 818 may also be used,such as clicking on the suggestion set words 810 to add positives andshift-clicking on the suggestion set words 810 to add negatives. Forlarge sets, the operator can copy an entire suggestion set 810 to theworking set 812. The suggestion sets 810 are recomputed for each edit.Clicking on the Done button 820 submits the union of the positives 816and the working set 812 as a new dictionary. Alternatively, clicking onthe Clear button 824 clears the words from the working set 812.

The dictionary editing interface could present machine-learning options(e.g., check box, thresholds) that constrain how they are used asfeatures. For instance, a dictionary interface could have checkboxes ordialog boxes for:

-   -   A flag that indicates whether each word has its own trainable        parameters (as opposed to one parameter for the whole        dictionary),    -   A flag or an option to make the feature value a function of        quantity (the dictionary feature could have 0 or 1 value        (binary) or be a pre-determined function of the dictionary term        frequency,    -   A flag that indicates whether the term frequencies are        normalized (e.g., multiplied by a function of the inverse term        frequencies, IDF),    -   A regularization threshold, which suggest the degree of tying        between the weight of a dictionary, and    -   A flag or an option to favor diversity: different word appearing        in a document generates a higher feature value than the same        word appearing multiple times.

The dictionary option interface can preview the generalization effectsof each option by training the classifier or entity extractor with orwithout the option and by measuring its performance on a validation set.

When the operator is finished, the union of the positive set and theworking sets is saved as the new dictionary. This interface is veryinteractive in the sense that the system provides immediate feedback tothe operator as to what it understood to be the concept. The operatorcan react and refine the system's interpretation.

There are many ways to generate valid concepts captured by a list ofwords. Some points are:

-   -   Users may generate a concept captured by a long list of words by        only typing a few positive and optionally a few negative        examples.    -   The concept editing is an interactive process that can go        through several refinements.    -   The suggestion sets can be of multiple natures. For instance,        one could come from a collection of pre-existing dictionaries        (based on tables found on the Web, or database such as        Freebase). Another could come from semantic concepts        automatically derived from clustering words based on a large        database of documents. A third one could come from analyzing a        click graph on (query, URL) pairs (queries that generate clicks        on the same page are probably related and their words are        probably in a related concept). Even though the suggestion sets        have very different origin, they can share a common interface        for concept editing. Some algorithms for active        conceptualization are described more fully below.

b. Active Conceptualization Algorithms

The ACI can be used to allow the operator to interact with differentactive conceptualization algorithms. For example:

-   -   Knowledge Bases: Freebase and Yago are examples of knowledge        databases that contain many human-entered dictionaries. It is        possible to test each human-entered dictionary for inclusion of        the positive and exclusion of the negative. A matching        dictionary is a suggestion set.    -   Click Graph: This graph is a bi-partite graph between queries        and web pages, where an edge means that a particular web page        was clicked by a user after submitting the corresponding query.        This induces a topology on the queries, and by extension, on        words. For instance, a set of words can be looked up as queries.        The click history on these queries induces a probability        distribution of clicks on the associated web pages by following        the edges of the graph for the queries. One can then induce a        probability on queries that could have generated the clicks on        these pages. The top (highest probability) queries of the        induced distribution can be used as a dictionary suggestion.    -   Link Graph: The hyperlink graph connects documents to each other        through hyperlinks embedded in their HTML code. This provides        another topology that can be exploited in a similar manner as        the proposed click graph technique.    -   Web Tables: An analysis of the tables (or the columns or rows of        tables) found on the Web can provide a list of semantically        meaningful dictionaries. An algorithm similar to Freebase can be        used to suggest dictionaries.    -   Semantic Representations: The internal representation of the        classifier induces a topology on English words. In that        topology, words that are close to the positive set and further        apart from the negative set are candidates for the suggestion        set.

Each of these algorithms provides a different form of generalization. Itis fortunate that a common interface can be used for an operator tointerface with all of them. The ACI allows an operator to enter conceptsimplemented by large dictionaries with relatively few interventions.

3. Dictionary Smoothing

One issue with using dictionaries to define a classifier is that adictionary may be likely to misfire on a word that occurs in multiple,unrelated contexts. For example, suppose a dictionary for movies isbuilt by inputting a list of movies found on the Web. However, the listincludes a movie called “It.” The problem with a movie called “It” isthat the word “it” may appear in almost every document in the database.This may significantly impact the dictionary's ability to measure thepresence of the intended concept. As another example, suppose adictionary is created for “months.” It misfires on sentences like “May Ihelp you,” and “I had dinner with April.” The problem is that in thewrong context, the word misfires and introduces errors.

Such potential misfiring can be addressed by means of dictionarysmoothing. The idea of dictionary smoothing is that the context of aparticular word may be used to try to predict whether the dictionaryshould fire on that word or not. The context of a given word includessome number of words that immediately precede and follow the word. Withregard to the “months” dictionary, for the word “May,” all the instancesof “may” throughout the entire corpus might be considered. For eachinstance of “may,” the two words before and the two words after the word“may” might be examined, for example. Based on those four words, aprediction may be made as to whether the word in the middle (“may”) is amonth or not.

Continuing with the example of using the two words before and the twowords after the given word, suppose that one looks at every possiblegroup of five words in a corpus. Suppose the corpus contains 100 millionpages, and every page has an average of 2000 words. For every group offive words, one may predict whether the middle word is a month from theother four context words. This may be done by counting word occurrencesover a large corpus. For each word, one may count the number of times itoccurs in a group of five words in which the middle word belongs to themonth dictionary. Similarly, one may count the number of times the wordoccurs in a group of five words in which the middle word does not belongto the month dictionary. With these counts, one may estimate theprobability that a group of five words contains a dictionary word bylooking only at the four context words.

For example, one might predict that “1998” is a good predictor of amonth. So, the phrase “May 1998” helps to determine that the dictionaryshould fire on that occurrence of “May.” Every four-digit number may begood predictor of months. However, in the sentence “May I help you,” theword “I” might be a good predictor of “may” (as a non-month), but is nota good predictor of “February,” i.e., “February I help you” is not aphrase that would occur often, if at all.

Additionally, one may choose not to train the system on problematicwords, e.g., don't train the system on the word “May.” In that case, thesystem is only trained to predict the desired concept without “may,” andso the word “I” will not contribute at all for “May I help you,” but“1998” will contribute because there are many examples of other monthsthat occur in the context of “1998.”

Another way of describing dictionary smoothing is to look for wordsubstitutability, i.e., whether other words in the dictionary can besubstituted for a given word. In a text window (i.e., the context of thegiven word), one may determine whether the middle word can bealternatively replaced by some of the dictionary words. For thatpurpose, one may examine a probability estimate, for each substitutedword, that the middle word belongs to the dictionary either using thecounting technique defined above, or other language modeling techniques.

For instance, suppose a car brand dictionary includes the terms Honda,Toyota, and Ford, and the sentence “President Ford came into Office in1973” is being evaluated. Without dictionary smoothing, the dictionarywould misfire on “Ford.” But if other car brands are substituted for“Ford” in that sentence, e.g., “President Honda,” or “President Toyota,”one may determine that the phrases “President Honda” and “PresidentToyota” do not occur, or rarely occur, within the entire corpus, and canthus determine that a context of “President X” is very unlikely for acar brand. As a result, the dictionary no longer fires on the phrase“President Ford” because within that context the other words in thedictionary cannot be substituted for “Ford.” This eliminates a largenumber of misfirings.

A detailed discussion of Dictionary Smoothing follows. The notions ofcontext and dictionary are defined, and then estimating the probabilityof words belonging to a dictionary as a function of contexts isdescribed.

a. Context

Given a document a and a position p, a word extraction function isdefined ase:(a,p)→wwhich returns the word at position p in document a. Given a set B=(b₀, .. . , b_(i−1)) of relative position to p, the context extractionfunction e_(B) is defined as:e _(B):(a,p)→e(a,p+b ₀), . . . ,e(a,p+b _(i−1))where e(a, p+b_(r)) is the word in document a at the r'th offset b_(r)with respect to position p. For example, for B=(−2, −1), e_(B)(a,p)returns the two words in document a just before position p. If documenta is “The quick brown fox jumps over the lazy dog”, thene_((−2,−1))(a,4)=(brown, fox). Note that for B=(0), e_(B)=e.

Notations: B=(b₀, . . . , b_(i−1)) is used to denote an ordered list.Equality between ordered lists requires all the elements to be equal andthe order to be respected. However, in b∈B, B is treated like a set(b∈{b₀, . . . , b_(i−1)}). The notation e₁ is used as a short form ofe_(B) _(i) .

Given a context extraction function e_(i), the contextual predicatec_(i) ^(w) is defined as:c _(i) ^(w)(a,p)=(w∈e _(i)(a,p))which means that the observed word w is in the context i of position pin document a. This predicate assumes that the position of word w in thecontext is not important.

Similarly, the formulac _(i) ^(w) ⁰ ^(, . . . ,w) ^(l-i) (a,p)=((w ₀ ,w _(l-1))=e _(i)(a,P))is defined to mean that the observed words w₀, . . . w_(l-1) are(exactly) the context i of position p in document a. To simplifycomputation, two assumptions are made: assume that position within acontext is not important, and that the presence of each word within acontext is independent of the presence of the other words. Theseassumptions lead to:

${P\left( {c_{i}^{w_{0},\ldots\mspace{14mu},w_{l - 1}}\left( {a,p} \right)} \right)} \approx {\prod\limits_{{w \in w_{0}},\ldots\mspace{14mu},w_{l - 1}}^{\;}\;{P\left( {c_{i}^{w}\left( {a,p} \right)} \right)}}$

b. Dictionary

A dictionary D={d₀, . . . , d_(k-1)} is defined as a set of k words.

c. Probability

Given a dictionary D and a set of m context functions c_(i), it isdesirable to compute:P(e(a,p)∈D|c ₀ ^(o) ⁰ (a,p), . . . ,c _(m-1) ^(o) ^(m-1) (a,p))which is the probability that the word at position p in document a is indictionary D, given that words o₀, o_(m-1) were observed in context 0, .. . , m−1. To simplify notation, c_(r) is used as a short form for c_(r)^(o) ^(r) (a,p).

Naïve Bayes: Using the Naïve Bayes assumption that the contexts areindependent and the words within the context are independent, one canwrite:

P(e(a, p) ∈ D❘c₀, …  , c_(m − 1)) = KP(c₀, …  , c_(m − 1)❘e(a, p) ∈ D)P(e(a, p) ∈ D)$\mspace{20mu}{{P\left( {c_{0},\ldots\mspace{14mu},{c_{m - 1}❘{{e\left( {a,p} \right)} \in D}}} \right)} \approx {\prod\limits_{i}^{\;}\;{P\left( {c_{i}❘{{e\left( {a,p} \right)} \in D}} \right)}}}$  where:$\mspace{20mu}{{P\left( {c_{i}❘{{e\left( {a,p} \right)} \in D}} \right)} \approx {\prod\limits_{{w \in w_{0}},\ldots\mspace{14mu},w_{l - 1}}^{\;}\;{P\left( {{c_{i}^{w}\left( {a,p} \right)}❘{{e\left( {a,p} \right)} \in D}} \right)}}}$where o_(r)=w₀, . . . , w_(i−1). The result is:

${P\left( {c_{i}^{w}\left( {a,p} \right)} \middle| {{e\left( {a,p} \right)} \in D} \right)} = \frac{\Sigma_{a \in {TrainSet}}\Sigma_{p \in {{position}\mspace{14mu}{in}\mspace{14mu} a}}\mspace{14mu}{\delta\left( {w \in {{e_{i}\left( {a,p} \right)}\mspace{14mu}{and}\mspace{14mu}{e\left( {a,p} \right)}} \in D} \right)}}{\Sigma_{a \in {TrainSet}}\Sigma_{p \in {{position}\mspace{14mu}{in}\mspace{14mu} a}}\mspace{14mu}{\delta\left( {{e\left( {a,p} \right)} \in D} \right)}}$where δ (predicate)=1 if predicate is true and 0 otherwise.

The counts can be pre-computed:

${{CountWordContext}\left( {j,i} \right)} = {\sum\limits_{a \in {TrainSet}}{\sum\limits_{p \in {{position}\mspace{14mu}{in}\mspace{14mu} a}}{\delta\left( {w_{j} \in {{e_{i}\left( {a,p} \right)}\mspace{14mu}{and}\mspace{14mu}{e\left( {a,p} \right)}} \in D} \right)}}}$${CountDict} = {\sum\limits_{a \in {TrainSet}}{\sum\limits_{p \in {{position}\mspace{14mu}{in}\mspace{14mu} a}}{\delta\left( {{e\left( {a,p} \right)} \in D} \right)}}}$${SumPosition} = {\sum\limits_{a \in {TrainSet}}{\sum\limits_{p \in {{position}\mspace{14mu}{in}\mspace{14mu} a}}{\delta({true})}}}$which then allows the efficient computation:

${P\left( {c_{0},\ldots,\left. c_{m - 1} \middle| {{e\left( {a,p} \right)} \in D} \right.} \right)} \approx {\underset{i}{\Pi}\underset{w_{j} \in o_{i}}{\Pi}\frac{{CountWordContext}\left( {j,i} \right)}{CountDict}}$${P\left( {{e\left( {a,p} \right)} \in D} \right)} = \frac{CountDict}{SumPosition}$This computation is O(Σ_(i)|B_(i)|) where |B_(i)| is context i's size.

To compute K, one also needs to evaluate:P(e(a,p)∉D|c ₀ , . . . ,c _(m-i))=KP(c ₀ , . . . ,c _(m)|e(a,p)∉D)P(e(a,p)∉D)Again, using Naïve Bayes:

${P\left( {c_{0},\ldots,\left. c_{m} \middle| {{e\left( {a,p} \right)} \notin D} \right.} \right)} \approx {\underset{i}{\Pi}{P\left( c_{i} \middle| {{e\left( {a,p} \right)} \notin D} \right)}}$where:${P\left( c_{i} \middle| {{e\left( {a,p} \right)} \notin D} \right)} \approx {\underset{{w \in w_{0}},\ldots,w_{l - 1}}{\Pi}{P\left( {c_{i}^{w}\left( {a,p} \right)} \middle| {{e\left( {a,p} \right)} \notin D} \right)}}$where o_(r)=w₀, . . . , w_(i−1). The result is:

${P\left( {c_{i}^{w}\left( {a,p} \right)} \middle| {{e\left( {a,p} \right)} \notin D} \right)} = \frac{\Sigma_{a \in {TrainSet}}\Sigma_{p \in {{position}\mspace{14mu}{in}\mspace{14mu} a}}\mspace{14mu}{\delta\left( {w_{j} \in {{e_{i}\left( {a,p} \right)}\mspace{14mu}{and}\mspace{14mu}{e\left( {a,p} \right)}} \notin D} \right)}}{\Sigma_{a \in {TrainSet}}\Sigma_{p \in {{position}\mspace{14mu}{in}\mspace{14mu} a}}\mspace{14mu}{\delta\left( {{e\left( {a,p} \right)} \notin D} \right)}}$

The counts can be pre-computed:

${{CountWordContectAll}\left( {j,i} \right)} = {\sum\limits_{a \in {TrainSet}}{\sum\limits_{p \in {{position}\mspace{14mu}{in}\mspace{14mu} a}}{\delta\left( {w_{j} \in {e_{i}\left( {a,p} \right)}} \right)}}}$${{CountWordContextNot}\left( {j,i} \right)} = {{{\sum\limits_{a \in {TrainSet}}{\sum\limits_{p \in {{position}\mspace{14mu}{in}\mspace{14mu} a}}{\delta\left( {w_{j} \in {e_{i}\left( {a,p} \right)}} \right)}}} - {\sum\limits_{a \in {TrainSet}}{\sum\limits_{p \in {{position}\mspace{14mu}{in}\mspace{14mu} a}}{\delta\left( {w \in {{e_{i}\left( {a,p} \right)}\mspace{14mu}{and}\mspace{14mu}{e\left( {a,p} \right)}} \in D} \right)}}}} = {{{CountWordContextAll}\left( {j,i} \right)} - {{CountWordContext}\left( {j,i} \right)}}}$Note that the quantity  CountWordContextAll(j, i)  is independent of the dictionary.This means that CountWordContextNot(j,i) does not actually require atable for this dictionary (it can be computed from CountWordContext(j,i)on the fly).

${CountDictNot} = {{\sum\limits_{a \in {TrainSet}}{\sum\limits_{p \in {{position}\mspace{14mu}{in}\mspace{14mu} a}}{\delta\left( {{e\left( {a,p} \right)} \notin D} \right)}}} = {{SumPosition} - {CountDict}}}$which then allows the efficient computation:

${P\left( {c_{0},\ldots,\left. c_{m - 1} \middle| {{e\left( {a,p} \right)} \notin D} \right.} \right)} \approx {\underset{i}{\Pi}\underset{w_{j} \in o_{i}}{\Pi}\frac{{CountWordContextNot}\left( {j,i} \right)}{{SumPosition} - {CountDict}}}$${P\left( {{e\left( {a,p} \right)} \notin D} \right)} = \frac{{SumPosition} - {CountDict}}{SumPosition}$$K = \frac{1}{\begin{matrix}{{{P\left( {c_{0},\ldots,\left. c_{m - 1} \middle| {{e\left( {a,p} \right)} \in D} \right.} \right)}{P\left( {{e\left( {a,p} \right)} \in D} \right)}} +} \\{{P\left( {c_{0},\ldots,\left. c_{m - 1} \middle| {{e\left( {a,p} \right)} \notin D} \right.} \right)}{P\left( {{e\left( {a,p} \right)} \notin D} \right)}}\end{matrix}}$and from that, one can compute:

${P\left( {\left. {{e\left( {a,p} \right)} \in D} \middle| c_{0} \right.,\ldots,c_{m - 1}} \right)} = {\frac{{P\left( {c_{0},\ldots,\left. c_{m - 1} \middle| {{e\left( {a,p} \right)} \in D} \right.} \right)}{P\left( {{e\left( {a,p} \right)} \in D} \right)}}{\begin{matrix}{{{P\left( {c_{0},\ldots,\left. c_{m - 1} \middle| {{e\left( {a,p} \right)} \in D} \right.} \right)}{P\left( {{e\left( {a,p} \right)} \in D} \right)}} +} \\{{P\left( {c_{0},\ldots,\left. c_{m - 1} \middle| {{e\left( {a,p} \right)} \notin D} \right.} \right)}{P\left( {{e\left( {a,p} \right)} \notin D} \right)}}\end{matrix}}.}$

i) Probability at the dictionary word level

It may be desirable to compute the probability that a word is a givenword of the dictionary given context:P(e(a,p)=w _(k) |c ₀ ^(o) ⁰ (a,p), . . . ,c _(m-1) ^(o) ^(m-1) (a,p))where w_(k) is a specific word in the dictionary.

${P\left( {\left. {c_{i}^{w}\left( {a,p} \right)} \middle| {e\left( {a,p} \right)} \right. = w_{k}} \right)} = \frac{\Sigma_{a \in {TrainSet}}\Sigma_{p \in {{position}\mspace{14mu}{in}\mspace{14mu} a}}\mspace{14mu}{\delta\left( {{w \in {{e_{i}\left( {a,p} \right)}\mspace{14mu}{and}\mspace{14mu}{e\left( {a,p} \right)}}} = w_{k}} \right)}}{\Sigma_{a \in {TrainSet}}\Sigma_{p \in {{position}\mspace{14mu}{in}\mspace{14mu} a}}\mspace{14mu}{\delta\left( {{e\left( {a,p} \right)} = w_{k}} \right)}}$where δ(predicate)=1 if predicate is true and 0 otherwise.

The counts can be pre-computed:

${{CountWordContextK}\left( {k,j,i} \right)} = {\sum\limits_{a \in {TrainSet}}{\sum\limits_{p \in {{position}\mspace{14mu}{in}\mspace{14mu} a}}{\delta\left( {{w_{j} \in {{e_{i}\left( {a,p} \right)}\mspace{14mu}{and}\mspace{14mu}{e\left( {a,p} \right)}}} = w_{k}} \right)}}}$${{CountK}(k)} = {{\sum\limits_{a \in {TrainSet}}{\sum\limits_{p \in {{position}\mspace{14mu}{in}\mspace{14mu} a}}{{\delta\left( {{e\left( {a,p} \right)} = w_{k}} \right)}{SumPosition}}}} = {\sum\limits_{a \in {TrainSet}}{\sum\limits_{p \in {{position}\mspace{14mu}{in}\mspace{14mu} a}}{\delta({true})}}}}$which then allows the efficient computation:

${P\left( {c_{0},\ldots,{\left. c_{m - 1} \middle| {e\left( {a,p} \right)} \right. = w_{k}}} \right)} \approx {\underset{i}{\Pi}\underset{w_{j} \in o_{i}}{\Pi}\frac{{CountWordContextK}\left( {k,j,i} \right)}{{CountK}(k)}}$${P\left( {{e\left( {a,p} \right)} = w_{k}} \right)} = \frac{{CountK}(k)}{SumPosition}$P(e(a, p) = w_(k)|c₀, …, c_(m − 1)) = K_(k)P(c₀, …, c_(m − 1)|e(a, p) = w_(k))P(e(a, p) = w_(k))

Computing K also includes evaluating:P(e(a,p)≠w _(k) |c ₀ , . . . ,c _(m-1))=K _(k) P(c ₀ , . . . ,c _(m)|e(a,P)≠w _(k))P(e(a,p)≠w _(k))

Again, using Naïve Bayes:

${P\left( {c_{0},\ldots,\left. c_{m} \middle| {{e\left( {a,p} \right)} \neq w_{k}} \right.} \right)} \approx {\underset{i}{\Pi}{P\left( c_{i} \middle| {{e\left( {a,p} \right)} \neq w_{k}} \right)}}$where:${P\left( c_{i} \middle| {{e\left( {a,p} \right)} \neq w_{k}} \right)} \approx {\underset{{w \in w_{0}},\ldots,w_{l - 1}}{\Pi}{P\left( {c_{i}^{w}\left( {a,p} \right)} \middle| {{e\left( {a,p} \right)} \neq w_{k}} \right)}}$where o_(r)=w₀, . . . , w_(t-1). The result is:

${P\left( {c_{i}^{w}\left( {a,p} \right)} \middle| {{e\left( {a,p} \right)} \neq w_{k}} \right)} = \frac{\Sigma_{a \in {TrainSet}}\Sigma_{p \in {{position}\mspace{14mu}{in}\mspace{14mu} a}}\mspace{14mu}{\delta\left( {w \in {{{e_{i}\left( {a,p} \right)}\mspace{14mu}{and}\mspace{14mu}{e\left( {a,p} \right)}} \neq w_{k}}} \right)}}{\Sigma_{a \in {TrainSet}}\Sigma_{p \in {{position}\mspace{14mu}{in}\mspace{14mu} a}}\mspace{14mu}{\delta\left( {{e\left( {a,p} \right)} \neq w_{k}} \right)}}$

For this, the following quantities are needed:

${{CountWordContextKNot}\left( {k,j,i} \right)} = {{{\sum\limits_{a \in {TrainSet}}{\sum\limits_{p \in {{position}\mspace{14mu}{in}\mspace{14mu} a}}{\delta\left( {w_{j} \in {e_{i}\left( {a,p} \right)}} \right)}}} - {\sum\limits_{a \in {TrainSet}}{\sum\limits_{p \in {{position}\mspace{14mu}{in}\mspace{14mu} a}}{\delta\left( {{w \in {{e_{i}\left( {a,p} \right)}\mspace{14mu}{and}\mspace{14mu}{e\left( {a,p} \right)}}} = w_{k}} \right)}}}} = {{{CountWordContextAll}\left( {j,i} \right)} - {{CountWordContextK}\left( {k,j,i} \right)}}}$${{CountKNot}(k)} = {{\sum\limits_{a \in {TrainSet}}{\sum\limits_{p \in {{position}\mspace{14mu}{in}\mspace{14mu} a}}{\delta\left( {{e\left( {a,p} \right)} \neq w_{k}} \right)}}} = {{SumPosition} - {{CountK}(k)}}}$

Note that the quantity CountWordContextAll(j,i) is independent of thedictionary. This means that CountWordContextKNot(k,j,i) does notactually require a table for this dictionary (it can be computed fromCountWordContextK(k,j,i) on the fly). The following computation can thenbe performed efficiently:

${P\left( {c_{0},\ldots\mspace{14mu},\left. c_{m - 1} \middle| {{e\left( {a,p} \right)} \neq w_{k}} \right.} \right)} \approx {\prod\limits_{i}\;{\prod\limits_{w_{j} \in o_{i}}\;\frac{{CountWordContextKNot}\left( {k,j,i} \right)}{{SumPosition} - {{CountK}(k)}}}}$$\mspace{20mu}{{P\left( {{e\left( {a,p} \right)} \neq w_{k}} \right)} = \frac{{SumPosition} - {{CountK}(k)}}{SumPosition}}$$\mspace{20mu}{K_{k} = \frac{1}{\begin{matrix}{{{P\left( {c_{0},\ldots\mspace{14mu},{\left. c_{m - 1} \middle| {e\left( {a,p} \right)} \right. = w_{k}}} \right)}{P\left( {{e\left( {a,p} \right)} = w_{k}} \right)}} +} \\{{P\left( {c_{0},\ldots\mspace{14mu},\left. c_{m - 1} \middle| {{e\left( {a,p} \right)} \neq w_{k}} \right.} \right)}{P\left( {{e\left( {a,p} \right)} \neq w_{k}} \right)}}\end{matrix}}}$

ii) Probability with Word Left Out

It may be desirable to compute the probability that a word is in adictionary minus word w_(k) given context:P(e(a,p)∈D−{w _(k) }|c ₀ ^(o) ⁰ (a,p), . . . ,c _(m-1) ^(o) ^(m-1)(a,p))where w_(k) is a specific word in the dictionary. Note that, ife(a,p)=w_(k), the probability above reflects the probability of all theother words in the dictionary. For instance, in the sentence “PresidentFord was the 38th president of United States,” the probability abovewill have been trained with all the words in the dictionary that aredifferent from “Ford.” If the dictionary is {“Honda”, “Ford”, “Toyota”},the probability would be very low since there are not many “PresidentHonda” or “President Toyota” instances. So the probability wouldcorrectly predict that “Ford” in the sentence is not a car brand.

${P\left( {c_{i}^{w}\left( {a,p} \right)} \middle| {{e\left( {a,p} \right)} \in {D - \left\{ w_{k} \right\}}} \right)} = \frac{\Sigma_{a \in {TrainSet}}\Sigma_{p \in {{position}\mspace{14mu}{in}\mspace{14mu} a}}{\delta\left( {w \in {{e_{i}\left( {a,p} \right)}\mspace{14mu}{and}\mspace{14mu}{e\left( {a,p} \right)}} \in {D - \left\{ w_{k} \right\}}} \right)}}{\Sigma_{a \in {TrainSet}}\Sigma_{p \in {{position}\mspace{14mu}{in}\mspace{14mu} a}}{\delta\left( {{e\left( {a,p} \right)} \in {D - \left\{ w_{k} \right\}}} \right)}}$where δ(predicate)=1 if predicate is true and 0 otherwise.

The counts can be pre-computed:CountWordContextDictMinusK(k,j,i)=CountWordContext(j,i)−CountWordContextK(k,j,i)CountDictMinusK(k)=CountDict−CountK(k)which then allows the efficient computation:

${{P\left( {c_{0},\ldots\mspace{14mu},\left. c_{m - 1} \middle| {{e\left( {a,p} \right)} \in {D - \left\{ w_{k} \right\}}} \right.} \right)} \approx {\prod\limits_{i}\;{\prod\limits_{w_{j} \in o_{i}}\;{\frac{{CountWordContextDictMinusK}\left( {k,j,i} \right)}{{CountDict} - {{CountK}(k)}}\mspace{20mu}{P\left( {{e\left( {a,p} \right)} \in {D - \left\{ w_{k} \right\}}} \right)}}}}} = \frac{{CountDict} - {{CountK}(k)}}{SumPosition}$P(e(a, p) ∈ D − {w_(k)}|c₀, …  c_(m − 1)) = K_(k)P(c₀, …  , c_(m − 1)|e(a, p) ∈ D − {w_(k)})P(e(a, p) ∈ D − {w_(k)})

Computing K also requires evaluating:P(e(a,p)∉D−{w _(k) }|c ₀ , . . . ,c _(m-1))=K _(k) P(c ₀ , . . . ,c _(m)|e(a,p)∉D−{w _(k)})P(e(a,p)∉D−{w _(k)})

Again, using Naïve Bayes:

$\mspace{20mu}{{P\left( {c_{0},\ldots\mspace{14mu},\left. c_{m} \middle| {{e\left( {a,p} \right)} \notin {D - \left\{ w_{k} \right\}}} \right.} \right)} \approx {\prod\limits_{i}\;{P\left( c_{i} \middle| {{e\left( {a,p} \right)} \notin {D - \left\{ w_{k} \right\}}} \right)}}}$  where:${P\left( c_{i} \middle| {{e\left( {a,p} \right)} \notin {D - \left\{ w_{k} \right\}}} \right)} \approx {\prod\limits_{{w \in w_{0}},\ldots\mspace{14mu},w_{l - 1}}\;{P\left( {c_{i}^{w}\left( {a,p} \right)} \middle| {{e\left( {a,p} \right)} \notin {D - \left\{ w_{k} \right\}}} \right)}}$where o_(r)=w₀, . . . , w_(i−1). The result is:

${P\left( {c_{i}^{w}\left( {a,p} \right)} \middle| {{e\left( {a,p} \right)} \notin {D - \left\{ w_{k} \right\}}} \right)} = \frac{\Sigma_{a \in {TrainSet}}\Sigma_{p \in {{position}\mspace{14mu}{in}\mspace{14mu} a}}{\delta\left( {w_{j} \in {{e_{i}\left( {a,p} \right)}\mspace{14mu}{and}\mspace{14mu}{e\left( {a,p} \right)}} \notin {D - \left\{ w_{k} \right\}}} \right)}}{\Sigma_{a \in {TrainSet}}\Sigma_{p \in {{position}\mspace{14mu}{in}\mspace{14mu} a}}{\delta\left( {{e\left( {a,p} \right)} \notin {D - \left\{ w_{k} \right\}}} \right)}}$

For this, the following quantities are needed:

CountWordContextDictMinusKNot(k, j, i) = CountWordContextAll(j, i) − CountWordContextDictMinusK(k, j, i)$\begin{matrix}{{{CountDictMinusKNot}(k)} = {\sum\limits_{a \in {TrainSet}}\;{\sum\limits_{p \in {{position}\mspace{14mu}{in}\mspace{14mu} a}}\;{\delta\left( {{e\left( {a,p} \right)} \notin {D - \left\{ w_{k} \right\}}} \right)}}}} \\{= {{SumPosition} - {{CountDictMinusK}(k)}}}\end{matrix}$

Note that the quantity CountWordContextAll(j,i) is independent of thedictionary. This means that CountWordContextDictMinusKNot(k,j,i) doesnot actually require a table for this dictionary (it can be computedfrom CountWordContextK(k,j,i) on the fly). The following computation canthen be performed efficiently:

${{P\left( {c_{0},\ldots\mspace{14mu},\left. c_{m - 1} \middle| {{e\left( {a,p} \right)} \notin {D - \left\{ w_{k} \right\}}} \right.} \right)} \approx {\prod\limits_{i}\;{\prod\limits_{w_{j} \in o_{i}}\;{\frac{{CountWordContextDictMinusKNot}\left( {k,j,i} \right)}{{SumPosition} - {{CountDictMinusK}(k)}}\mspace{20mu}{P\left( {{e\left( {a,p} \right)} \notin {D - \left\{ w_{k} \right\}}} \right)}}}}} = \frac{{SumPosition} - {{CountDictMinusK}(k)}}{SumPosition}$$\mspace{20mu}{K_{k} = \frac{1}{\begin{matrix}{{{P\left( {c_{0},\ldots\mspace{14mu},\left. c_{m - 1} \middle| {{e\left( {a,p} \right)} \in {D - \left\{ w_{k} \right\}}} \right.} \right)}{P\left( {{e\left( {a,p} \right)} \in {D - \left\{ w_{k} \right\}}} \right)}} +} \\{{P\left( {c_{0},\ldots\mspace{14mu},\left. c_{m - 1} \middle| {{e\left( {a,p} \right)} \notin {D - \left\{ w_{k} \right\}}} \right.} \right)}{P\left( {{e\left( {a,p} \right)} \notin {D - \left\{ w_{k} \right\}}} \right)}}\end{matrix}}}$

4. Feature Completion

Feature Completion is a more generalized approach to DictionarySmoothing. Learning techniques to automatically classify documents infera classifier from a set of labeled training instances. The inferredclassifier is a function, which takes a set of input features, i.e.,measurements that describe the document, and outputs a class label. Onecan mainly improve the accuracy of a classifier following twoalternative paths, either by acquiring more labeled training instances,or by relying on better features. Feature completion is directed towardthe second approach and aims at facilitating the design of betterfeatures.

A feature is a function that maps the raw representation of the document(e.g., sequence of characters for text, map of pixels for images . . . )to an intermediate representation that the classifier relies on (e.g.,the number of occurrences of a given word or the presence of a specificcolor in the image). Most features are built from a simple humanintuition about the types of measurements that a classifier could relyon (e.g., a classifier that detects faces in images could use thepresence of skin color as a feature). However, the conversion of anintuition to a function that maps the document representation is acomplex, imperfect task.

Feature completion facilitates this conversion process. It takes asinput the initial feature given by the human and provides acomplementary feature that complements the first one, so that thecombination of both features is closer to the initial intuitedmeasurement. For that purpose, it relies on a large dataset of unlabeleddocuments. The raw representation of the unlabeled documents is dividedinto the part that the initial feature uses (representation A) and therest (representation B). Given this set of paired representations on theunlabeled set, a learning algorithm is applied to infer a function thattakes representation B and predicts the output of the initial feature onpart A of the same document. This function is a complementary featuresince it behaves similarly to the initial feature but relies on thecomplementary part of the raw representation (i.e., representation B).The combination of the initial feature and the complementary feature maybe closer to the initial intuition since it uses the remainder of thedocument that the initial feature implementation did not manage toexploit. The combination of the two features is also more robust tonoise since corruptions are unlikely to affect representation A andrepresentation B in the same way.

One should note that the classifier determines how to combine theinitial feature and its complementary counterpart. This means that thelearning algorithm determines for the user whether a complementaryfeature should have little influence (since the initial feature wasalready high quality) or more influence (since the initial feature waspoorer quality).

In one aspect, a system and method are provided to build complementaryfeatures. Each complementary feature is built from an initial featureand a large set of unlabeled data. A complementary feature is a functionthat takes as input the part of the raw representation the initialfeature is not using. It is built by trying to predict the output of theinitial feature from this complementary representation over theunlabeled data.

In another aspect, the system and method may include one or moreadditional features, such as where the initial feature measures thepresence of a disjunction of words or n-grams (sequence of words) ateach position in a text stream, while the complementary feature inputconsists of a window of text around the considered position in which thecenter words have been removed; where the initial feature is a regularexpression operating over strings to predict matching position in text,while the complementary feature input consists of a window of textaround the considered position in which the center words have beenremoved; or where the initial feature measures the presence of adisjunction of short nucleotide sequences at each position in a largenucleotide sequence (e.g., DNA), while the complementary feature inputconsists of a window of few nucleotides around the considered positionin which the center nucleotides have been removed.

The following discussion describes exemplary algorithms for featurecompletion. Feature completion starts with an initial feature and alarge unlabeled dataset. A complementary feature is built from theseinputs. Once built, this complementary feature can then be used inconjunction with the initial feature in a supervised learning setting.

a. Definitions

-   -   A dataset is a set of items. For example, a data set could be a        collection of web pages, a collection of queries, a collection        of word documents, a collection of molecules, a collection of        genes, etc. Each item is represented by its raw representation.        This representation is a set of measurements made on the item.        The measurements can be of fixed length, such as the number of        links pointing to web page, or of variable lengths such as a        list of tokens representing each word, with possible annotations        (e.g., bold, italic, table position, metadata, etc). The purpose        of the raw representation is to capture all the information        relative to an item into a computer readable form, without        discerning a priori which information is relevant or irrelevant.        A feature representation is a function of the raw        representation, which captures the information that is relevant        to a machine learning algorithm for performing a task on the        item, such as classification, extraction, regression, ranking,        and so forth. The feature representation typically discards a        lot of information from the raw representation because the raw        representation space is far too vast for a machine-learning        algorithm to perform adequately with a small number of training        examples and finite computational time.    -   The initial feature representation f is the feature        representation that is started with. It takes part of the raw        representation of an item and computes a value or a vector of        values. An example of value could be the length of an item, the        number of times a particular sub-component is present in an        item, etc. A vector value could be the result of sliding a        window over the item and computing a function over that window.        For instance, for a window of text, the initial feature could be        -   a binary value representing whether any word from a given            list appears at the center of the window,        -   a binary value representing the presence or absence of a            verb in the window,        -   a binary value representing the presence or absence of a            noun followed by an adjective,        -   an integer feature counting the number of occurrences of a            given word in the window, etc.    -   A complementary feature g is also a feature representation. It        takes a different part of the raw representation of an item and        predicts a value or a vector of values. It is built relying on        the algorithm defined in the next section.    -   This discussion distinguishes two parts in the raw        representation of an item.

Representation A refers to the part the initial feature uses.Representation B refers to the part the complementary feature uses. Notethat both parts may or may not overlap.

-   -   A supervised learning algorithm takes a set of input/output        pairs and predicts a function that aims at predicting the output        given the input.

b. Algorithms to Build a Complementary Feature

i) Generic Algorithm BuildComplementary

This algorithm computes an additional feature function g. It uses thedataset D and the function ƒ to generate (input, targets) pairs astraining examples for g. It then uses a training algorithm to train g.The result is a new feature function g, which can then be used tocomplement ƒ.

-   -   Input: an initial feature f, a dataset D    -   Output: a complementary feature g    -   Algorithm        -   Initialize a complementary feature training set P to the            empty set        -   For each item i in D            -   Extract a_(i) (representation A for i) and            -   Compute the output of the initial feature f(a_(i))            -   Extract b_(i) (representation B for i)            -   Add (b_(i), f(a_(i))) to P. This (input, target) pair is                a training example for function g        -   g=SupervisedLearningAlgorithm(P)        -   Return g

If the features are computed on sliding windows, the algorithm can bemodified as this:

-   -   Input: an initial feature f, a dataset D    -   Output: a complementary feature g    -   Algorithm        -   Initialize a complementary feature training set P to the            empty set        -   For each item i in D            -   For each position p in item                -   Extract a_(i,p), (representation A for i in initial                    window indexed by p) and                -   Compute the output of the initial feature f(a_(i,p))                -   Extract b_(i,p), (representation B for i in context                    window indexed by p)                -   Add (b_(i,p), f(a_(i,p))) to P. This (input, target)                    pair is a training example for function g        -   g=SupervisedLearningAlgorithm(P)        -   Return g

ii) Specialization for the Binary Case

Assume that f is a binary feature and representation B is a set of nbinary measurements. This means that for any item i, f(a_(i)) is either0 or 1, while b, can be denoted as a vector (b_(i1), . . . , b_(im)) inwhich each b_(ij) is 0 or 1. Consider a class of supervised learningalgorithms that relies only on the following counts from P, N(j, α, β),which denotes the number of pairs (b_(i), f(a_(i))) in P such thatf(a_(i))=α and b_(ij)=β. In this case, the complementary featurebuilding algorithm can be rewritten as

-   -   Input: an initial feature f, a dataset D    -   Output: a complementary feature g    -   Algorithm        -   Initialize N(j, α, β) to zero for j=1 . . . n, α=0 . . . 1,            β=0 . . . 1        -   For each item i in D            -   Extract a_(i) (representation A for i) and            -   Predict the output of the initial feature f(a_(i))            -   Extract b_(i) (representation B for i)            -   Increment N(j, f(a_(i)), b_(ij)) for j=1 . . . n        -   g=SupervisedLearningAlgorithm(N)        -   Return g

c. Complementary Features for Classification

Classification as used herein is the task of predicting a class labelgiven an input item. For that purpose, use is made of a supervisedlearning algorithm, which can automatically infer a function that mapsan input feature representation to a class label from a set of labeleditems, i.e., items for which the correct class has been identified by ahuman labeler. A label item (x,y) is denoted, where x denotes its rawrepresentation x and y denotes its label.

The following algorithm takes a set of labeled items, an unlabeleddataset and a set of initial features f₁ . . . f_(n). It complementseach feature and learns a classifier that relies both on the initialfeature and its complementary feature.

-   -   Input: a set of initial features f₁ . . . f_(n), a set of        labeled items L, an unlabeled dataset U    -   Output: a set of complementary features g₁ . . . g_(n), a        classifier C relying on both f₁ and g₁ . . . g_(n).    -   Algorithm        -   For each initial feature f_(i),            -   define its complementary from the unlabeled data                g _(i)=BuildComplementary(f _(i) ,U)        -   Initialize pair set P to the empty set        -   For each labeled item (x,y) in L,            -   compute initial features and its complementary features                v(x)=f ₁(x), . . . ,f _(n)(x),g _(i)(x) . . . g _(n)(x)            -   Add (v(x), y) to P        -   C=SupervisedLearningAlgorithm(P)        -   Return g₁ . . . g_(n) and C

As an example, consider the following collection of documents in Table4:

TABLE 4 Document ID Content 0 “cut off date is May 18 2012”; 1 “PostedThursday , May 24 , 2012 at 10”; 2 “Published on February 18 2001”; 3“Customers Viewing This Page May Be Interested in”; 4 “Posted Thursday ,February 24 2012 at 10”; 5 “He bought 24 candles”; 6 “May I suggest thatyou read”; 7 “Beatles - Let It Be - Lyrics”

Assume the initial feature is: Word belongs to the set {“February”,“May”}. The concept that the initial feature is trying to capture is theconcept of Month. Unfortunately, it will not work well in documents 3and 6 because the feature will fire even though those particular 2instances of “May” are not referring to months. Any learning algorithmthat depends on the initial feature will therefore be handicapped by thefeature's “misfiring.”

To compensate for this problem, a simple complementary feature may bebuilt. Please refer to the Generic algorithm “BuildComplementary”described above, regarding windows. Formally, the initial representationa_(i,p) is a fixed length window of length one (single word) for item icentered on position p. The second representation b_(i,p) is also afixed length window of length one, but it is centered on the word atposition p+1. This window is referred to herein as the “context” window.

In this example, the complementary feature g is trying to better predictthe concept of month. To build this feature, a very simple Bayesianalgorithm is used as the learning algorithm to compute g. The function gis defined as:g(w)≡P(ƒ(word at p)=1|word at (p+1) is w)where the word w is read from position p+1 where g is evaluated. In thiscase, it helps to think of the representation b_(i,p) as being aroundposition p.

Note that other representations could be used, rather than “word atposition p+1” as input for g, and any other machine-learning algorithmcould be used to train g to mimic the values of ƒ. In this case, aBayesian model is used because a closed form version of g can be givenand demystify the process by giving an explicit machine-learningalgorithm. Using Bayes' rule, one can write:

${g(w)} = {{P\left( {{word}\mspace{14mu}{in}\mspace{14mu}{Dict}} \middle| {{following}\mspace{14mu}{word}\mspace{14mu}{is}\mspace{14mu} w} \right)} = \frac{{P\left( {{following}\mspace{14mu}{word}\mspace{14mu}{is}\mspace{14mu} w} \middle| {{word}\mspace{14mu}{in}\mspace{14mu}{Dict}} \right)}{P\left( {{word}\mspace{14mu}{in}\mspace{14mu}{Dict}} \right)}}{P\left( {{following}\mspace{14mu}{word}\mspace{14mu}{is}\mspace{14mu} w} \right)}}$

As an example, g will be computed for the second document at position 3(w=“24”). Looking at the corpus, one can infer:

${P\left( {{word}\mspace{14mu}{in}\mspace{14mu}{Dict}} \right)} = {\frac{6}{54} = \frac{1}{9}}$because there are 54 words in the corpus and 6 of these are in thedictionary. For the second instance of May (in document 1),

${P\left( {{following}\mspace{14mu}{word}\mspace{14mu}{is}\mspace{14mu}{``24"}} \middle| {{word}\mspace{14mu}{in}\mspace{14mu}{Dict}} \right)} = {\frac{2}{6} = \frac{1}{3}}$because there are six instances of the word in the dictionary and in twoof these instances, the following word is “24.” Computing P(followingword is X) is done by realizing that: P(word in Dict|following word isX)+P(word not in Dict|following word is X)=1

This leads toP(following word is “24”.)=P(following word is “24”. |word inDict)P(word in Dict)+P(following word is “24”. |word not in Dict)P(wordnot in Dict)or

${P\left( {{following}\mspace{14mu}{word}\mspace{14mu}{is}\mspace{14mu}{``24"}} \right)} = {{{\frac{1}{3}\frac{1}{9}} + {\frac{1}{48}\frac{8}{9}}} = \frac{1}{18}}$And finally:

${P\left( {{word}\mspace{14mu}{in}\mspace{14mu}{Dict}} \middle| {{following}\mspace{14mu}{word}\mspace{14mu}{is}\mspace{14mu} X} \right)} = {{\frac{1}{3}\frac{1}{9}\frac{18}{1}} = \frac{2}{3}}$

If this is done for all the instances, the result is:

Document 0: P(“May” in Dict|following word is “18”)=1.0

Document 1: P(“May” in Dict|following word is “24”.)=0.6666

Document 2: P(“February” in Dict|following word is “18”)=1.0

Document 3: P(“May” in Dict|following word is “Be”)=0.5

Document 4: P(“February” in Dict|following word is “24”.)=0.6666

Document 5: P(“May” in Dict|following word is “I”)=1.0

One can see that this complementary feature is better because if it usesa threshold of 0.6, it will detect that May in document 3 is a verb andnot a month. But it is not perfect because it fails to detect that Mayin document 5 is also a verb rather than a month.

Below is an example where a more complex context function was computedon a large corpus of documents (500,000 web pages). The primary functionlooks at one word and is one if word belongs to (“January”, “February” .. . , “December”) and zero otherwise. The complementary feature looks atthe two words before and the two words after and uses Naïve Bayes tocompute the probability of being in the dictionary. For this, a variantof the algorithm above is used, which herein is referred to as “LeaveOne Out.” In this version, the function g used on a particular word istrained on all the instances of the data set except the instances thatare defined by that word.

This is useful because when a word has a double meaning (e.g., like May,which can be a month or a verb), it may be trained only with instancesthat exclude its own double meaning. The double meaning of May couldpotentially pollute the other months, but that is often not a problembecause the context for double meaning for different cases on which ƒ=1are often not correlated. For instance if g(February, .) is trained witha set that excludes all instances of February but includes all the othermonths including May, the bad cases like “May I help you?” will dolittle damage to the February model because the context “I” is quiteunlikely for February (“February I help you?”).

The listing in Table 5 below shows 100 instance examples taken at randomfrom the data set, and sorted by the value of complementary feature g.The value is shown in the column with heading “Prob.” The following 4columns are the “evidence” at position −2, −1, +1+2 (relative to Maybeing at position 0). Each evidence can be computed as:

${{Evidence}(k)} = \frac{P\left( {{{word}\mspace{14mu}{at}\mspace{14mu}{position}\mspace{14mu} p} + k} \middle| {{word}\mspace{14mu}{at}\mspace{14mu}{position}\mspace{14mu} p\mspace{14mu}{is}\mspace{14mu}{{in}\left( {{dict} - {May}} \right)}} \right)}{P\begin{pmatrix}\left. {{{word}\mspace{14mu}{at}\mspace{14mu}{position}\mspace{14mu} p} + k} \right| \\{{word}\mspace{14mu}{at}\mspace{14mu}{position}\mspace{14mu} p\mspace{14mu}{is}\mspace{14mu}{not}\mspace{14mu}{{in}\left( {{dict} - {May}} \right)}}\end{pmatrix}}$

The following column Label is the “concept” value or whether theparticular occurrence is indeed a month. This value is computed by handjust for the purpose of evaluation. Inspection of the list in Table 5shows that initial feature would produce 21% error rate. In contrast,the complementary feature using a threshold of p=0.0003 would only havea 2% error rate.

TABLE 5 # Doc# pos Prob Ev#0 Ev#1 Ev#2 Ev#3 Label N-gram 0 26 334 0.00001.22 1.21 1.65 1.26 0 Grams Customers Viewing This Page May BeInterested in These Sponsored 1 632 418 0.0000 1.22 1.21 1.65 1.26 0 99Customers Viewing This Page May Be Interested in These Sponsored 2 96201 0.0000 1.15 1.39 1.44 1.26 0 the choice below . You May Also Need 1/ 2 3 426 29 0.0000 1.18 1.39 1.26 1.38 0 Prequalify Grants for WomenYou May Qualify for Grants to Earn 4 361 197 0.0000 1.13 1.24 1.50 1.140 narrow your search results later May We Suggest These Cool Products 5364 1256 0.0000 1.15 1.19 1.99 1.09 0 real self again . ″ May be he waspostman ultra 6 470 812 0.0000 1.10 1.39 1.36 1.12 0 4 ) by Taboola YouMay Like Why Stylists Hate Boxed 7 901 1322 0.0000 1.08 1.32 1.09 1.33 0NJ GECKO ' S Cape May , NJ SERAFINA Wyckoff , 8 550 284 0.0000 1.05 1.191.48 1.31 0 number of times : ″ May I suggest that you read 9 586 380.0000 1.15 1.39 1.26 1.16 0 Go To School . You May Qualify For GrantsTo Start 10 799 218 0.0000 0.72 1.10 1.79 1.20 0 : ( Estimated ) * Maynot reflect current interest rates 11 848 162 0.0000 0.72 1.10 1.79 1.200 : ( Estimated ) * May not reflect current interest rates 12 336 4530.0000 0.85 1.39 1.44 1.11 0 Bags when Flying Comments You May Also LikeHow to Get 13 1008 161 0.0000 0.72 1.39 1.44 1.11 0 ( 2 min ) You MayAlso Like Comments Hulu Plus 14 782 1587 0.0000 1.10 0.53 1.99 1.17 0 -Jan 22 , 2012 May be beneficial . . . 15 816 2104 0.0000 0.93 1.01 1.451.25 0 Rihanna In Court Josh Smith May Become Free Agent 50 Cent 15 1025359 0.0000 1.10 1.31 1.50 0.98 1 - $ 420 , 000 May . 28 , 2004 4944 17300 951 0.0000 0.97 0.99 1.23 1.41 0 Throat Strep ? Flu Vaccines MayProtect the Heart Too Health 18 616 395 0.0001 1.07 1.14 1.11 1.04 0Qwote Pitbull Bedroom ( David May Mix ) ( Off | 19 1011 106 0.0001 1.161.01 1.09 1.24 0 Press Review : • Mathilda May , in French Magazine ‘ 28145 117 0.0002 1.15 0.79 1.26 1.16 0 To School Online . Moms May QualifyFor Grants To Start 21 502 497 0.0004 1.15 1.07 1.09 0.89 1 111 5207589Current conducting system May , 1993 Lettenmayer 439 / 22 1035 2960.0005 0.90 0.73 1.42 1.20 1 Tanaka , visited Beijing in May to welcomeits 1000th member 23 794 276 0.0005 1.08 0.92 1.14 1.02 1 T F S S << MayJul >> 1 2 3 24 404 599 0.0009 1.42 1.27 0.71 0.75 1 . Caught on theriver May 04 2012 11 : 22 25 429 1332 0.0012 0.79 0.90 1.16 1.17 1 992mm Genuine Birthstone - May Emerald Yellow Gold Nose Bone 26 947 12780.0044 0.94 0.61 1.34 0.58 0 Makete Katsu ( Japan ) May Queen ( Korean )Miss 27 0 174 0.0060 1.05 0.84 0.37 1.42 1 Article Index Akashadoothu :09 May 2012 current position Watch Aakashadoothu 28 659 134 0.0062 1.420.96 0.51 1.20 1 World and Beating the Odds May 2006 Views : 23 | 29 84140 0.0080 1.06 1.31 0.64 0.28 1 & Health Culture Change Language May 10, 2012 , 4 30 318 1311 0.0102 0.91 0.61 1.33 0.88 1 ( May ' 11 ) May '11 animal control 3 31 533 84 0.0124 1.16 1.11 0.43 0.98 1 - · - PopularVenues May 2008 The River Ranch - 32 530 40 0.0167 1.18 0.77 0.64 1.20 1: 01 AM - 24 May 12 · Embed this Tweet 33 772 546 0.0186 1.35 1.06 0.540.28 1 is a Date object for May 28 , 2007 d = 34 499 51 0.0209 1.15 0.471.12 1.03 1 Br J Dermatol . 2010 May ; 162 ( 5 ) 35 192 375 0.0255 0.840.64 1.49 1.06 1 album Compass out 17th 18th May on Warp Records warpnet 36 821 329 0.0283 1.19 1.12 0.34 0.87 1 ( Locks Received & InstalledMay 2011 - Yoda ) Also 37 305 1252 0.0373 0.97 1.04 0.53 1.24 1 Road .Both classes end May 27 . Beginners will attend 38 875 1077 0.0434 0.950.78 0.79 1.15 1 McDade 18 Jul 1913 15 May 1976 Davis , Noah Vester 3961 512 0.0454 1.19 0.92 0.54 1.00 1 The Shiite pilgrims were abductedMay 22 after crossing into Syria 40 1031 190 0.0461 1.12 0.73 0.37 1.231 studies at Bradley University in May 2012 and am always looking 41 763359 0.0466 1.00 0.72 0.73 0.87 1 March . Summer Rates : May 1 - November14 ; 42 393 1223 0.0503 1.07 0.63 0.72 1.24 1 - 25 . Epub 2006 May 4 .ClinicalTrials . gov 43 86 105 0.0525 1.19 1.17 0.54 0.28 1 contractVigneault ' s contract May 23 , 2012 7 : 44 694 275 0.0769 1.19 1.110.54 0.28 1 infringing Oracle ' s patents May 23 , 2012 1 : 45 610 16780.1129 1.10 0.51 0.59 1.24 1 Baba ' s film on May 13 . Those of us 46814 87 0.1263 1.01 0.91 0.37 1.01 1 Cwpan Ceredgion Fixtures Results 7May 2012 Final New Quay 3 47 438 1156 0.1341 1.10 1.02 0.59 0.28 1Helpful Customer Reviews Adult Briefs May 18 , 2012 By Dave 48 656 600.1345 1.00 0.69 0.47 1.12 1 brands Essay by swashukla , May 2007download word file , 49 872 430 0.1490 0.74 1.01 0.37 1.24 1 the lastupdate on 3 May 2012 . [ State of 50 152 381 0.1501 1.02 1.07 0.59 0.281 Angeles , CA Robert Pattinson May 13 , 1986 London , 51 13 1061 0,17521.12 0.51 0.72 0.75 1 0 Hot - Juan on May 4 2012 # growrealfood - 52 17267 0.1823 1.01 1.33 0.53 0.28 1 Stafford from his hospital bed May 29th, 2012 at 11 53 419 3 0.2125 0.83 0.72 0.63 1.13 1 ..CommunicatorArchives : May 2002 Choose another issue Is 54 347 283 0,2152 1.01 1.040.59 0.28 1 of Elsa Margareta Sibirien 1736 May 18 , 1735 Age 18 55 217402 0.2351 0.83 1.33 0.59 0.28 1 the survey cutoff date was May 18 ,meaning that the 56 299 651 0.2386 0.83 0.61 0.71 0.93 1 ) June ( 30 )May ( 15 ) April ( 57 67 459 0,2790 1.17 0.77 0.37 0.90 1 Section ASection A 30 May 2012 S M T W 58 939 39 0.2984 1.05 0.76 0.37 1.21 1robotic library Updated : 21 May 2010 | 19 comments Chris 59 230 630.3124 1.10 0.78 0.79 0.28 1 . m . , updated May 2 , 2011 at 11 60 588581 0,3157 1.03 0.92 0.64 0.28 1 Life : D Dominic Watson May 12 , 2010at 6 61 422 114 0.3200 1.18 0.77 0.37 0.87 1 communities . Kolkata - 24May 2012 - Cargill re - 62 270 1969 0.3967 1.10 0.80 0.37 0.92 1 hit -Wed , 02 May 2012 16 : 25 : 63 826 50 0,4446 1.18 0.70 0.64 0.81 1 : 45PM - 31 May 12 via TweetDeck · Embed 64 330 1001 0.5139 1.15 0.41 0.710.98 1 Gift twenty two . 

May ( 28 ) 

 April 65 1033 534 0.5152 0.85 0.90 0.37 0.87 1 _ Master 12 Comments 10May 2012 - 01 : 44 66 573 193 0.5254 1.05 0.82 0.43 0.87 1 AIDS ArticleDate : 01 May 2008 - 5 : 00 67 758 1734 0.6657 1.15 0.41 0.71 0.89 1Formulas . . . 

  May ( 9 ) 

 April 68 58 137 0.7770 1.05 0.76 0.37 0.80 1 . . published : 21 May2012 Author : Magnolia3Scooby 4 69 9 1559 0.7961 0.95 0.86 0.59 0.28 1announced Hero Complex Film Festival May 18 , 19 , 20th 70 726 5630.8236 0.79 0.73 0.37 1.15 1 . Flag as inappropriate 27 May 2010 Georgiacommented on this 71 198 15 0.8330 0.82 0.96 0.59 0.28 1 Punk editorrating release date May 16 , 1995 duration 31 72 667 140 0.8689 0.860.69 0.55 0.28 1 12 : 04 AM , May 24 , 2012 | comments 73 684 17030.8874 1.02 0.61 0.37 0.58 1 June 2010 ( 564 ) May 2010 ( 658 ) April 743 471 0.8970 0.72 0.41 0.71 0.92 1 June ( 2 ) 

May ( 4 ) ▾ April 75 560 961 0.8993 0.74 0.77 0.37 0.77 1 Posted byDicky on 30 May 2012 at 17 : 32 76 297 25 0.9143 0.89 0.51 0.64 0.28 1Pages This item sold on May 10 , 2011 . Here 77 862 739 0.9150 0.72 0.410.71 0.90 1 June ( 9 ) 

  May ( 7 ) 

 April 78 651 84 0.9321 0.75 0.72 0.67 0.28 1 : Java Last Modified : May6 , 2009 Snippet / 79 267 165 0.9330 0.87 0.61 0.47 0.58 1 June 2007 ( 1) May 2007 ( 11 ) April 80 342 709 0.9392 0.84 0.61 0.37 0.58 1 June2012 ( 26 ) May 2012 ( 167 ) April 81 325 533 0.9629 0.95 0.78 0.34 0.281 DIONIS RUIZ 6 307 16 May 2011 , 10 : 41 82 274 489 0.9649 0.92 0.510.56 0.28 1 Reply ↓ Mac Hayes on May 19 , 2012 at 5 83 689 624 0.96930.64 0.72 0.40 0.90 1 jar84203 Member Join Date : May 2009 Posts : 85Thanks 84 613 1235 0.9785 0.88 0.65 0.34 0.90 1 jjaudio Swap Meet 4 20thMay 2011 12 : 29 PM 85 662 812 0.9850 1.01 0.49 0.73 0.56 1 ; E -Learning industry May 1995 - January 1996 ( 86 405 1440 0.9915 0.64 0.720.47 0.69 1 Registered User Join Date : May 2007 Location : Illinois For87 557 51 0.9923 0.64 0.72 0.56 0.28 1 Light Against Dark Released : May19 , 2008 Label : 88 578 201 0.9937 0.71 0.51 0.57 0.28 1 This photo wastaken on May 25 , 2012 . 128 89 372 378 0.9942 0.68 0.53 0.37 0.77 1 inDandeli Archives June 2012 May 2012 Categories dandeli Dandeli Forest 90496 196 0.9967 0.46 0.72 0.53 0.28 1 Storage Content | Posted : May 27 ,2008 4 : 91 287 250 0.9975 0.87 0.62 0.37 0.28 1 Display Modes # 1 30thMay 2010 , 14 : 28 92 11 550 0.9978 0.68 0.53 0.37 0.67 1 2012 July 2012June 2012 May 2012 April 2012 Categories 40 93 537 1026 0.9978 0.68 0.530.37 0.67 1 2012 July 2012 June 2012 May 2012 April 2012 March 2012 94251 72 0,9979 0.47 0.69 0.54 0.28 1 Contributor Published : Saturday ,May 23 , 2009 Print | 95 865 1621 0.9985 0.43 0.69 0.55 0.28 1 :ReportsnReports Posted Thursday , May 24 , 2012 at 10 96 900 202 0.99950.68 0.53 0.43 0.67 1 2008 July 2008 June 2008 May 2008 April 2008 March2008 97 252 1462 0.9997 0.58 0.45 0.34 0.67 1 2011 October 2011 June2011 May 2011 April 2011 March 2011 98 518 559 0.9997 0.68 0.49 0.400.67 1 2009 October 2009 June 2009 May 2009 April 2009 March 2009 99 594200 0.9997 0.79 0.49 0.51 0.56 1 WIT ; Management Consulting industryMay 2006 - January 2010 (

V. Segmentation and Schematization

A. Segments

By construction, the bag-of-words representation ignores allrelationships between words. This may be a limitation because orderingand grouping information can be valuable. For instance, decomposing aforum web page into a sequence of individual posts could be useful forfinding posts that compare two products. In the bag-of-wordsrepresentation, one would get a hit every time two posts mentioning thetwo products appear in the same page. Decomposing a schema intoindividual fields allows field-targeted search and pivoting. This couldbe useful for finding recipes that have less than 500 calories perserving and a cooking time under 20 minutes.

To enable these capabilities, assume that each item consists of anordered sequence of tokens. This token-based representation is muchricher than bag-of-words. The tokens' positions induce an ordering and aproximity metric between tokens. The distance between two tokens is theabsolute difference between their positions. (In this section, aone-dimensional topology is assumed for simplicity. A two-dimensionaltopology is possible but more complicated (segments are replaced byrectangles.)) A segment is defined as a pair (b,e) of positions in thedocument. The first position b (for begin) points to the first token ofthe segment. The second position e(for end) points to the first tokenoutside the segment. Each segment characterizes a group of adjacenttokens inside the document. A document segmentation is a collection (s₀,. . . , s_(k-1)) of k disjoint segments. More formally, the set ofpossible segmentations of a document of n tokens is defined by:S={s:s=(s ₀ , . . . ,s _(k-1)):k≦n,∀i∈0 . . . k−1,s _(i)=(b _(i) ,e_(i)):0≦b ₀ ,b _(i) <e _(i) ,e _(i) ≦b _(i+1) ,e _(k-1) <n}

A feature ƒ_(l)(i,d) is a vector function of the document d, definedover each of the token position i. The featurization of the document isdefined as ƒ(d)=(ƒ₀(., d), . . . , ƒ_(j-1)(., d)), where J is the numberof individual features. Note that the feature value at position i maydepend on the whole document. This definition of feature is generalenough to encompass global features (constant over all tokens), tokenfeatures (features whose value at position i only depend on the token atthat position), or trellis (which will be introduced later in thissection). A segment classifier h is a function that computes aprobability:h:d,s,w→h(ƒ(d),s,w)where d is the original data, ƒ(d) is a featurization of the token data,s is a segmentation over the tokens, and w is a trainable parametervector. Ideally, the segment classifier should verify:

${\sum\limits_{s \in S}\;{h\left( {{f(d)},s,w} \right)}} = 1$

FIG. 9 illustrates an exemplary segmentation 900 of a street address.The top part of FIG. 9 is a visualization of the data 910 (a portion ofa web page). Below that is a token representation 912 of the same data,with a street address segmentation 914 underneath:s=((4,15),(21,34),(40,53)).

The street address segmentation contains 3 segments 914 labeled as“street address” (however, the third segment is not shown because ofspace constraints on the page). A restaurant name segmentation wouldhave returned ((0,3), (17,20), (36,39)). Ideally a street addresssegment classifier would return h(ƒ(d), s, w)=1 for s=(4,15), (21,34),(40,53)) and 0 for any other value of s. This would be the targetsignal, or segment label.

B. Modularity and Trellis

Schemas have a recursive structure. A schema's field can itself be aschema. For example, a StreetAddress schema can be made out of 5sub-schemas:

-   -   StreetAddress        -   Street        -   City        -   State        -   Zip code        -   Country

As defined herein, the modularity constraint is the ability to buildsegmenters independently of the context in which they can be used. Thebenefit of modularity is that once a segmenter is built, it can be usedas a feature for a higher level segmenter in a bottom fashion (similarto the features of a classifier). As described earlier, features areconstrained to be immutable. This implies that once a segmenter isbuilt, it will not be retrained inside a higher level segmenter to takeadvantage of contextual information. This at first appears to be asevere limitation. For instance, a street extractor would do a muchbetter job if it knew about context. Is “Smith Lane, 1234” a streetaddress or a name? If a lower level segmenter decides what is a streetand what isn't, the higher level address segmenter is not likely toperform well.

Trellis: To circumvent this problem, a constraint is imposed that thesegmenter return not a segmentation, but a trellis. A trellis is atransition graph between the states of each token. FIG. 10 illustrates atrellis representation 1000 of a segmenter 1024. For a given entityextractor, each token 1010 has 3 states: Junk 1012 (entity notdetected), Begin 1014 (first token of entity), and Continue 1016(subsequent tokens 1010 of entity). The edges 1018 are the transitionprobability from one token 1010 to the next. A segmentation is the mostlikely path from the beginning of the document to the end of thedocument. The transition probabilities are a convolution function over awindow of token features. Let e_(s) ₁ _(,s) ₂ _(,i) denotes thetransition probability between the state S_(i) of token i and the states₂ of token i+1. Thene _(s) ₁ _(,s) ₂ ,i=g(ƒ(d)_(i) ,w _(s) ₁ _(,s) ₂ )where g is a fixed trainable function, ƒ(d)_(i) is a token featurizationwindow centered on i, and w_(s) ₁ _(,s) ₂ is a set of trainableparameters for each transition s₁, s₂. As described above, the beginstate 1014 and continue state 1016 are states where the segment has beendetected, and the state transition edges 1018 are functions of the tokenfeatures 1020 that compute the probability of a transition. In absenceof other constraints, the segmentation is the optimal transition path1022 (heavy solid line).

An advantage of the trellis representation is that it allows a low levelsegmenter to communicate to a higher level segmenter the probability ofevery possible segmentation. In the absence of other constraints, thedefault segmentation is the optimal path to traverse the trellis. Thiscan be computed in O(n) steps using dynamic programming. When a lowlevel segmentation is used by a higher level segmenter, the higher levelsegmenter can output its segmentation, and then find the optimal lowerlevel segmentation by finding the optimal transition path subject toconstraints. For instance, for an address segmenter, the sub-segments(street, city, Zip code, state, and country) cannot cross the addressboundaries (parent constraint) and a given token can only belong to oneof the sub-segments (sibling constraint). In other words, thesub-segmenters do not make the final decisions for their own segment.They provide a probability for each possible segmentation for the levelabove where the decision is made. Computing the high level segmentationis a bottom up process. It is followed by a field filling pass (orback-segmentation) where new segmentation at each level are computedusing the current trellis and constraints from parents and siblings.

For each sub-segmenter, the total number of possible segmentations andtheir corresponding probability is O(2^(n)) for n tokens. Fortunately,the trellis representation carries all that information in O(n) space.To compute the probability of a particular segmentation from thetrellis, one can simply determine which of the 3 states each token is inand sum all the edges while following the corresponding path on thetrellis.

When a trellis is used as a feature for training a higher levelsegmenter, it becomes a token feature (every edge value is associated tothe token to its left).

C. Labeling Segments

Labeling segments could be extremely tedious. Each word in a documentrequires a label. The trellis structure allows for interactive segmentlabeling. The main feature of a trellis is that it enables the searchfor the optimal path subject to constraints on the states. The defaultsegmentation comes from the optimal trellis path without constraints.This segmentation can assign the default labels to each visible token.The labels can be made visible to the operator by highlighting thevisual representations (e.g., words) of the corresponding tokens whenthey are either in the Begin or Continue state.

Each click on the bounding box of a visible token (e.g., word) togglesthe state of the token. The distinction between Begin and Continue is arather subtle one; it allows the distinction between a long segment andtwo adjacent ones. This is a UX challenge. Once a visible token has beenclicked, it is constrained. Tokens that have never been clicked areunconstrained. For every operator click on a visible token, a constrainthas been added/changed/removed. This triggers a dynamic programmingoptimization on the trellis to find the new resulting optimal path inO(n) steps. This will likely change the default labels of the remainingunconstrained tokens. In other words, the system is working with theoperator to always display the best solution given the operatorconstraints. For instance, one click anywhere on a missed address islikely to trigger the whole address to be labeled as a segmentcorrectly. This is because if any of the address token is part of anaddress segment, the likelihoods of the adjacent tokens to be part of anaddress are greatly increased. If the optimal trellis path is computedon every click, tokens tend to flip in logical groups. This makeslabeling segments less tedious and requires less hand-eye coordination.Note that every click is forward progress because it results in an addedconstraint. A visual clue may be provided to indicate which visualtokens got their values by default and which got their values bylabeling.

Confidence:

Similar to classification labels, it may be desirable to deemphasize theimportance of labeling accuracy. It is desirable that the operator wouldonly look at segments or missed segments that have a low confidence andlabel these first. An interesting UX challenge is: how should confidencebe displayed?

Given a document with a few identified segments, the low confidencesegments should visually pop out so that the operator could zoom in onthese, make a decision, and submit the new labels without having to readthe whole document. This is even more desirable for missed segments. Ona given document, the most likely candidate for a segment shouldvisually pop out so that the operator can zoom in on these and take theappropriate action. If there are no low-confidence candidates, theoperator should be able to ignore the whole document without reading it.

Displaying segment confidence is not trivial. There are 0(2^(n))possible segmentations. Displaying confidence at the token level wouldbe misleading and the page would look like salt and pepper. Forinstance, every number or instance of the word “main” could be acandidate for a missed address.

This problem is solved by going back to the trellis representation. Thedefault path provides a path score at the document level. Called thisscore the Default Optimal Path Score, or DOPS. This global score has nomeaning at the token level. If a token is clicked, its label is changedand the new optimal path given this constraint provides a differentscore. Call this new score COPS(token), for constrained optimal pathscore. This new score by itself has no meaning at the token level.However, the differenceConf(token)=DOPC−COPS(token)is the system estimate of the effect of flipping the label of a giventoken. If the difference is close to 0, then the system is not confidentthat it has the right label (flipping it has not effect). Note that0≦Conf(token)≦1since path scores are probabilities and DOPC is the optimal path when nostate is constrained. If the score is close to 0, then the system is notconfident on whether the corresponding token belongs to a segment. Froma UX perspective, confidence can be color-coded at the token level, orthe low confidence tokens, which verify Conf(token)≦K, where K is aconfidence threshold, can be highlighted. Since labels tend to flip ingroups, adjacent tokens are likely to have the same score differences,so it is possible to indicate to the operator which tokens will fliptogether when one label is changed. It is at least plausible that anoperator may label a document by just looking at the low confidencesegments (or low confidence non-segments) and may take action only onthese segments without having to read the entire document. This is asignificant decrease of the segment labeling cost.

The optimal path given a constraint is computed in O(n) using dynamicprogramming. If Conf(token) is computed for every token, a naïveimplementation would consume O(n²) steps. If a document has 100,000tokens, this could become a problem. Fortunately, the whole functionConf(token) can be computed in O(n). The trick is to do two dynamicprogramming passes, one in each direction, to compute the optimal pathin both directions from the current token to each end of the document.Both of these passes are done in O(n). The quantity Conf(token) issimply the sum of the scores of the two half paths.

To find the documents that are most likely to have a segment, thesegment classifier can be turned into a regular classifier with theoperation:

${h^{\prime}\text{:}d},{\left. w\rightarrow{\sum\limits_{\forall{{s\mspace{14mu}{s.t.\mspace{14mu} s}} \neq {()}}}\;{h\left( {{f(d)},s,w} \right)}} \right. = {1 - {h\left( {{f(d)},{()},w} \right)}}}$

In other words, h′ is the sum of the probabilities of all segmentationsthat contain at least one segment. It returns the probability that thereis at least one segment on the page.

VI. Segment Extraction

Segment extraction (AKA entity extraction or EE) is the process ofidentifying token segments in a document that correspond to a givenconcept. As an example, suppose a user is interested in automaticallyextracting addresses and their constituent parts (city, state, etc.)from a web page so that he or she can quickly look them up on a map.FIG. 11 depicts a simplified representation of a web page 1110 thatincludes an address 1112 along with labels 1114 and correspondingconstituent parts 1116 of the address that have been extracted from theweb page.

Statistical methods for segment extraction typically use training datato build a finite state machine (FSM) that can be used to decode adocument. An example finite state machine for extracting addresses isillustrated in FIG. 12. The nodes 1210, 1212, and 1214 are the states ofthe FSM, and the edges 1214, 1216, 1218, 1220, 1222, and 1224 aretransitions between states. Each dashed transition (1218 and 1216)“consumes” a document token and labels it as being part of an address,whereas each dotted edge (1214 and 1224) consumes a token and labels itas NOT being part of an address. The solid edges are epsilon transitionsthat do not consume any tokens.

Given a document, the FSM is “rolled out” to create a correspondingtrellis that can be used to calculate path probabilities in thedocument, as illustrated in FIG. 13. FIG. 13 includes the trellis 1310,edges 1312, nodes 1314, and document tokens 1316. For the sake ofclarity, only some of the edges and nodes are labeled. FIG. 13 depictseach token 1316 aligned beneath the possible paths for that token.

Each edge 1312 in trellis 1310 has a weight that is a function offeatures in the document. Using standard decoding algorithms (e.g.,Viterbi), one can identify the highest-weight path through the trellis1310 and output the corresponding labeling of the tokens 1316 andtransitions (edges) 1312. One can also train the weight functions sothat the probability of any given path can be extracted.

The edge-weight functions are typically functions of token features thatare “near” the edge of interest, although this is not a requirement. Inthe example under discussion, and with reference to FIG. 14, supposethere are two token features, IsNumber and IsStreetType, which aredepicted as token features 1410. IsNumber, which is 1 if the token 1412corresponds to a number (“1401” and “THIRD”) and IsStreetType which is 1for tokens 1412 corresponding to types of streets (“STREET”, “ST”,“AVENUE”, “AVE”). Then each token 1412 has a corresponding featurevector 1414 of dimension 2, as illustrated in FIG. 14.

With reference again to FIG. 13, consider the edge-weight function forthe solid “horizontal” edge in the trellis 1310. This function couldlook at the features of the token before the transition and the tokenafter the transition:Weight(Features)=θ₁×IsNumber(token before)+θ₂×IsStreetType(tokenbefore)+θ₃×IsNumber(token after)+θ₄×IsStreetType(token after).

The parameters O are trained to maximize some loss function on atraining set. The training set typically contains labels that correspondto paths along a trellis. Intuitively, the training algorithms try tolearn weight functions such that the labeled paths in the training datahave higher total weight than the non-labeled paths.

Training data can also specify constraints on the allowed set of pathsthrough a trellis without uniquely identifying a single path. In theexample described above, one could have a label indicating that “1401,”“THIRD,” and “AVENUE” are all addresss tokens; because of the structureof the trellis, this does not uniquely identify the path, but ratherconstrains the path to the dashed token-consuming edges on the middlethree tokens.

A. Hierarchical State Machine

In most segment-extraction domains, the concepts of interest arehierarchical. In the address example, an address has sub-concepts suchas street, and street can have sub-concepts as well. Such a domain canbe represented as a “concept hierarchy,” where the root node representsthe concept of interest, and children nodes correspond to mutuallyexclusive sub-components; by mutually exclusive is meant that a singletoken can belong to at most one of the sub-components (thus, “Third” canbe part of a street or part of a zip code, but it cannot be part ofboth).

Finite state machines can be specified hierarchically in a number ofdifferent ways to simplify the representation. Consider a hierarchicalfinite state machine (HFSM) in which an FSM is defined recursively usingmodules; the transitions within a module can correspond to “normal”state transitions, or they can refer to transitions into sub-modules.

As an example, FIG. 15 illustrates two modules. Module “X” 1510 on theleft has module edges 1512, labeled “mY”, which transition into module“Y” 1514 and a transition edge “tX” 1516, which is a normal transitionedge that consumes a token. Module Y 1514 has a normal transition edge“tY” 1518 that consumes a token and a normal transition edge 1520 thatdoes not consume any tokens. By recursively replacing the module edges1512 with the sub modules, one recovers a standard corresponding FSM, asillustrated in the FSM 1600 depicted in FIG. 16. The FSM 1600 includestransition edges “tY” 1610, transition edge “tX” 1612, and transitionedges 1614, which correspond, respectively, to transition edge “tX”1516, transition edge “tY” 1518, and transition edge 1520 of FIG. 15.

B. Interactively Constructing Segment Extraction Models

To build a segment-extraction system for a domain, a machine-learningexpert is typically needed to (1) define the structure of the underlyingfinite state machine, (2) define the feature functions for the edges,which requires tuning the size of the “window” to consider around eachedge as well as which features to use, and (3) tune the resulting modelso that it meets the performance requirements of the application. Also,the machine-learning expert usually starts with a fixed labeled trainingset and test set. Described below is a system that allows a domainexpert to construct entity extraction models without the need for amachine-learning expert.

An interactive system for building segment extractors may include ameans for the user to specify constraints governing whether a tokenbelongs or not to a particular segment, and a means for storing theseconstraints as labels (labeling capability); a means for the system tore-compute and display the most plausible segments interactively usingthe latest user input, the current document information, and a trainablefunction (interactive propagation of labels, with no retraining); ameans for the system to train the trainable function using allpreviously input labels (machine learning required, slow non-interactivetraining); and a means for the system to automatically select whichexample to label next, based on the score computed by the trainablefunction (active labeling).

C. Concept Hierarchy

With the technology described herein, domain experts can provideinteractively a concept hierarchy corresponding to the domain ofinterest. In the address example, it does not take a machine-learningexpert to be able to decompose an address into its constituent parts. Byproviding a user interface that allows the domain expert to specify theconcept hierarchy, and then converting that hierarchy into an HFSM byusing default structure within the modules, and/or by using labeled datato choose among candidate structures, sophisticated extraction modelscan be built without the domain expert knowing or caring about statemachines.

Furthermore, the “language” that the domain expert uses can be extendedto allow him to provide additional constraints within the machine. Forexample, the domain expert may want to state that an address can containat most one zip code, or that any address must have a street portionpresent.

Additionally, a domain expert can build an extractor for some concept,and then “plug it in” as a sub-concept for another task. Thiscorresponds to having modules in an HFSM correspond to previouslytrained HFSM. In the example, someone could build a zip-code extractoroutside the context of addresses. Then, when specifying the concepthierarchy for addresses, the person could say that the zip-codesub-concept corresponds to the previous concept. When one does such a“plug in”, one may decide to freeze the weights of the sub-machine sothat they do not need to be trained in the new domain.

An interactive system for building segment extractors may include one ormore of: a user interface allowing the user to specify interactively aconcept hierarchy, and it may be that no other information about thehierarchical state machine is provided by the user, and the system usesdefault strategies and/or model-selection strategies to complete thespecification of the hierarchical state machine. An interactive systemfor building segment extractors may be such that the user can provide aconcept hierarchy and one or more additional constraints about thedomain that translate into constraints on the hierarchical statemachine, and may also be such that an additional constraint is that asub-concept instance can occur at most once in an instance of its parentconcept (e.g., an address can contain at most one zip code). There mayalso be additional constraints including that a sub-concept instancemust appear at least once in an instance of its parent concept (e.g., anaddress must contain a state), a partial order over the sub-concepts(e.g., city must precede state in an address), and that two siblingsub-concepts cannot both appear in an instance of their parent concept(an address cannot contain a U.S. postal code and a Canadian postalcode).

An interactive system for building segment extractors may also be suchthat previously built models for concepts can be re-used (e.g., someonebuilds a zip-code extractor and you can tell the system that you want touse that same extractor but in the context of your address extractor).It may also be that the parameters of the re-used extractor are frozen(i.e., the edge-weight functions are fixed) for the edges containedwithin the module, but where the edge-weight functions on the in-comingand out-going transition edges to that module are trained for context.

D. Label Modularity/Binary Labeling

When labeling a hierarchical concept such as address, it can be tediousto label all constituent parts of an address for every document. It ismuch easier for the domain user to concentrate on one node in thehierarchy (“Address” or “Zip Code”) at a time, quickly labeling manydocuments.

Label modularity, as used herein with regard to labeling, refers tolabeler focus, i.e., the ability to label/optimize for one module at atime. Note that because all modules are connected together in the HFSM,improvements and labels for one module can improve the other modules atthe same time; label modularity is used specifically to mean modularityof user focus.

As used herein, a module in an HFSM is said to be binary if the labelsto be elicited by the user are characterized by “in” or “out” labels onmodules. In particular, a token labeled “in” is the restriction that theedge “consuming” the token must be contained with the given module orone of its descendants (e.g., if a token is labeled “Address,” it can beany one of its child concepts or an implicit “Address:other”).Similarly, a token labeled “out” is the restriction that the edge“consuming” the token cannot be contained within the given module or anyof its descendants.

A non-binary HFSM would be one where additional labels are available.For example, suppose a “Street” module consumed two distinct labels thatdo not correspond to sub-modules: Street1 and Street2. Then a labelingtool might be able to elicit from the user which type of street a tokenis. Of course, this could be converted into an equivalent binarylabeling of IsStreet1 and IsStreet2.

When each module in an HFSM is binary, then a binary labeling tool canbe used to elicit labels for the HFSM on a per-module basis. FIG. 17depicts an exemplary screen shot 1700 of a system for binary labeling ofaddresses.

A concept hierarchy 1710 is shown on the left, having a root node 1712(“Address”) and three children 1714 (“Street,” “City,” and “Zip Code”).As depicted, the user has the root node 1712 selected. In thecorresponding HFSM, there is a child concept “Address:Other” not shownexplicitly to the user that allows the machine to accept address tokensthat do not belong to the three children (such as punctuation, fillertext, etc.). A web page 1716 returned as a search result is displayed onthe right. To label the tokens on the page 1716 that are part of anaddress, having first selected the root node 1712, the user clicks onthe first token 1718 (“15710 NE 24^(TH) ST. SUITE E”) and drags to thelast token 1720 (“98008”) of the address, thereby selecting the entireaddress portion. FIG. 18 depicts a portion of the search results fromFIG. 17, and is generally referred to as search results 1800. FIG. 18illustrates a user selection of an entire address portion 1810.

Note that knowing the tokens that are part of the address does notprovide explicit labels about which tokens are Street, City or Zip Code.The user then clicks the Submit button 1722 of FIG. 17, and is shown anew document. The new document shown may be based on an explicit searchterm the user provided (e.g., pages containing “98008”), or based on anactive learning algorithm (see below) that uses an existing model.

After labeling a number of documents, the system trains a model that canbe used to “pre label” addresses. Furthermore, the pre-label can takeconstraints into account to quickly elicit labels; if a proposed labelis not correct, the user can click on a single token that has the wronglabel, and this constraint can “propagate” to other tokens in thedocument.

The user can change which concept to label by clicking on thecorresponding node in the concept hierarchy, such as “Street,” “City,”or “Zip Code.” Thus, if the user wants to label cities next, he canclick on the city node and proceed to label cities within addresses ondocuments, as depicted in FIG. 19. FIG. 19 depicts an exemplary screenshot 1900 of a system for binary labeling of addresses comparable tothat of FIG. 16, and is generally referred to as screen shot 1900.

A concept hierarchy 1910 is shown on the left, having a root node 1912(“Address”) and three children nodes: child node 1914 (“Street”), childnode 1916 (“City”), and child node 1918 (“Zip Code”). As depicted, theuser has the “City” node 1916 selected. A web page 1920 returned as asearch result is displayed on the right. As depicted, the user hasselected a token 1922 (“BELLEVUE”) as a city. With reference to FIG. 20,which depicts an exemplary screen shot 2000 comparable to a portion ofscreenshot 1900, note that when a user labels tokens as being “City,”this implies that they are part of an address. If the user changes fromCity to Address before submitting the label, he will see that his citylabel has implied an address label, as illustrated in FIG. 20. With rootnode 2010 (“Address”) now selected, the token 2012 (“Bellevue”) remainsselected, indicating that it is associated with the label of “Address.”

An interactive system for building segment extractors may allow thedomain expert to provide binary (in/out) labels associated with nodes ina concept hierarchy.

E. Segment Extraction Models and Classification Models as Features

Once an entity extraction model has been constructed, it can be used asinput to the edge-weight functions in another entity extractor. Forexample, one could use an EE model to predict, for each token in adocument, the probability that the token is part of an address. Thisprobability, or some function of that probability, could then be used asone of the token feature values along with the other “standard” featurevalues.

Entity extraction models can also be used to create document-levelfeatures for classification models. For example, one could be building arestaurant-page classifier that has a feature that, withprobability >0.5, an address exists on the page. Entity extractionmodels can also use classification models as features. An interactivesystem for building segment extractors may use pre-builtsegment-extraction models and/or pre-built classification models togenerate input features for a segment-extraction model.

F. Segment Extraction Review Panel

When a segment-extraction model has been built, it is useful to see howthat model predicts on a document that the user has already labeled.Mismatches between the predicted labels and the actual labels canindicate labeling errors or can suggest new features to add. FIG. 21illustrates an exemplary screen shot 2100 of a review panel that doesthis, using the extraction problem of identifying dates. FIG. 21includes document text 2110, token 2112 (“02/21/07”), token 2114(“JANUARY”), and token 2116 (“BY”). A user-identified label is indicatedby an underline 2118 beneath token 2112. Model predictions 2120 areindicated by the upper three sides of a rectangle placed over the tokens2112, 2114, and 2116. As shown in FIG. 21, the model has correctlyidentified “02/21/07” as a date, but has falsely labeled “JANUARY BY” asa date. Although “JANUARY” is a month, in the context shown, it is notpart of an actual date.

FIG. 22, which illustrates an exemplary screen shot of a modelprediction in a document that the user has labeled, depicts a situationwhere the model correctly identified token 2210 (“JULY 23”), but hasmissed token 2212 (“7-23-12”) as being a date.

An interactive system for building segment extractors may have aninterface to review labels with an existing model's predictions at thesame time.

G. Mini-Documents

Documents such as web pages or book chapters can be very long. As aresult, “labeling a document” can be tedious simply because the labelerneeds to scan the entire document. To mitigate this problem, documentscan be segmented into more manageable sub-documents, but without losingthe context of the segment that is being labeled. With regard to FIG.23, which illustrates a screen shot 2300 of an exemplary labeling tool,a highlighted portion of a document, referred to as minidoc 2310, isdepicted, consisting of the “bright” rectangle in the middle. Thecontext around minidoc 2310 is visible to the labeler, but, in oneembodiment, when the user submits a label, only the portion(s) of textwithin minidoc 2310 are submitted to the system. The user can change thesize of minidoc 2310 by click-dragging its boundaries. Alternatively, ifthe user labels a segment of text outside minidoc 2310, then minidoc2310 may be expanded to include that text.

A minidoc may be initialized in a number of ways. For example, given anexisting model, one can identify a likely (or perhaps uncertain) addressof interest, and then define a minidoc that contains that token segment.An interactive system for building segment extractors may segment aninput document into smaller sub-documents. Additionally, thesub-documents may be automatically initialized based on a pre-existingsegment-extraction model or on proximity to specific tokens or tokenfeatures.

With regard to FIG. 24, a flow diagram is provided illustrating oneexample method 2400 of feature completion for machine learning. Method2400 is but one example of a suitable method and is not intended tosuggest any limitation as to the scope of use or functionality of thetechnology described herein. Neither should method 2400 be interpretedas having any dependency or requirement relating to any one orcombination of components illustrated. Method 2400 includes thefollowing operations.

At step 2410, storing a first set of data items, wherein each data itemincludes a text stream of words. At step 2412, providing a dictionary,wherein the dictionary includes a list of words that define a conceptusable as an input feature for training a machine-learning model toscore data items with a probability of being a positive example or anegative example of a particular class of data item. At step 2414,providing a feature that is trained to calculate a first probability ofa presence, within a stream of one or more words, of a disjunction ofone or more n-grams that correspond semantically to the concept definedby the words in the dictionary. At step 2416, utilizing the feature todetermine the first probability of the presence, within a stream of oneor more words, of a disjunction of one or more n-grams that correspondsemantically to the concept defined by the words in the dictionary at agiven word position in the data item. At step 2418, providing amachine-learning model that is trainable to calculate a secondprobability of the presence, within the stream of one or more words atthe given word position, of the disjunction of the one or more n-gramsthat correspond semantically to the concept defined by the words in thedictionary, based on one or more words in the data item not utilized bythe feature to determine the first probability. At step 2420, utilizingthe machine-learning model to determine the second probability of thepresence, within the stream of one or more words at the given wordposition, of a disjunction of one or more n-grams that correspondsemantically to the concept defined by the words in the dictionary,based on the one or more words in the data item not utilized by thefeature to determine the first probability. At step 2422, determining anactual presence or absence, at the given word position, of thedisjunction of the one or more n-grams that correspond semantically tothe concept defined by the words in the dictionary. At step 2424,modifying the machine-learning model to adjust the second probability ina positive or negative direction based on the determined actual presenceor absence of the disjunction of the one or more n-grams that correspondsemantically to the concept defined by the words in the dictionary.

The invention claimed is:
 1. A system for feature completion for machinelearning, comprising: one or more processing devices that: store a firstset of data items, wherein each data item includes a text stream ofwords; provide a dictionary, wherein the dictionary includes a list ofwords that define a concept usable as an input feature for training amachine-learning model to score data items with a probability of being apositive example or a negative example of a particular class of dataitem; provide a feature that is trained to calculate a first probabilityof a presence, within a stream of one or more words, of a disjunction ofone or more n-grams that correspond semantically to the concept definedby the words in the dictionary; utilize the feature to determine thefirst probability of the presence, within a stream of one or more words,of a disjunction of one or more n-grams that correspond semantically tothe concept defined by the words in the dictionary at a given wordposition in the data item; provide a machine-learning model that istrainable to calculate a second probability of the presence, within thestream of one or more words at the given word position, of thedisjunction of the one or more n-grams that correspond semantically tothe concept defined by the words in the dictionary, based on one or morewords in the data item not utilized by the feature to determine thefirst probability; utilize the machine-learning model to determine thesecond probability of the presence, within the stream of one or morewords at the given word position, of a disjunction of one or moren-grams that correspond semantically to the concept defined by the wordsin the dictionary, based on the one or more words in the data item notutilized by the feature to determine the first probability; determine anactual presence or absence, at the given word position, of thedisjunction of the one or more n-grams that correspond semantically tothe concept defined by the words in the dictionary; and modify themachine-learning model to adjust the second probability in a positive ornegative direction based on the determined actual presence or absence ofthe disjunction of the one or more n-grams that correspond semanticallyto the concept defined by the words in the dictionary; wherein thefeature determines one or more of: whether any words from a given listappear at the center of a window of text around the given word positionin which center words in the window of text have been removed, apresence or absence of a verb in the window, a presence or absence of anoun followed by an adjective, or a number of occurrences of a givenword in the window.
 2. The system of claim 1, wherein the featuredetermines the presence of a disjunction of one or more n-grams at eachconsidered position in a text stream, while the machine-learning modelinput includes a window of text around the considered position in whichcenter words in the window of text have been removed.
 3. The system ofclaim 1, wherein the feature is a regular expression that operates overstrings to predict semantically matching positions in text within astring at each considered position, while the machine-learning modelinput includes a window of text around the considered position in whichcenter words in the window of text have been removed.
 4. The system ofclaim 1, wherein modify the machine-learning model to adjust thecalculated probability includes adjust the calculated probability in apositive direction when the disjunction of the one or more n-grams ispresent.
 5. The system of claim 4, wherein modify the machine-learningmodel to adjust the calculated probability includes adjust thecalculated probability in a negative direction when the disjunction ofthe one or more n-grams is not present.
 6. The system of claim 1,wherein the window of text is a sliding window.
 7. The system of claim1, wherein utilize the one or more words in the data item not utilizedby the feature includes utilize a text window that includes a number ofwords immediately preceding a given word position and a number of wordsimmediately following the given word position.
 8. The system of claim 1,wherein the window of text is a sliding window that includes a number ofwords immediately preceding a given word position and a number of wordsimmediately following the given word position.
 9. One or more hardwarecomputer-storage media having embodied thereon computer-usableinstructions that, when executed, facilitate a method of featurecompletion for machine learning, the method comprising: storing a firstset of data items, wherein each data item includes a text stream ofwords; accessing a dictionary, wherein the dictionary includes a list ofwords that define a concept usable as an input feature for training amachine-learning model to score data items with a probability of being apositive example or a negative example of a particular class of dataitem; and training the machine-learning model with the dictionary as aninput feature, wherein the training includes, for each data item in thefirst set of data items: for a first word position in the text streamwithin the data item, examining a window of text centered at a secondword position in the text stream, wherein the window of text includesone or more words, utilizing a probability function to calculate aprobability of the presence, at the first word position, of adisjunction of one or more n-grams that correspond semantically to theconcept defined by the words in the dictionary, based on the one or morewords in the window of text, determining an actual presence or absence,at the first word position, of a disjunction of one or more n-grams thatcorrespond semantically to the concept defined by the words in thedictionary, wherein the determining comprises determining one or moreof: whether any words from a given list appear at the center of a windowof text around the given word position in which center words in thewindow of text have been removed, a presence or absence of a verb in thewindow, a presence or absence of a noun followed by an adjective, or anumber of occurrences of a given word in the window, and modifying theprobability function to adjust the probability in a positive or negativedirection based on the determined actual presence or absence of thedisjunction of one or more n-grams that correspond semantically to theconcept defined by the words in the dictionary.
 10. The media of claim9, wherein the window of text is a sliding window that includes a numberof words immediately preceding a given word position and a number ofwords immediately following the given word position.
 11. The media ofclaim 9, wherein modifying the probability function to adjust theprobability includes modifying the probability function to increase theprobability when the disjunction of the one or more n-grams correspondssemantically to the concept defined by the words in the dictionary. 12.The media of claim 11, wherein modifying the probability function toadjust the probability includes modifying the probability function todecrease the probability when the disjunction of the one or more n-gramsdoes not correspond semantically to the concept defined by the words inthe dictionary.
 13. The media of claim 9, wherein when the window oftext overlaps the first word position, one or more words at the firstword position are excluded from the window of text, and wherein thesecond word position may be different than the first word position orthe same as the first word position.
 14. One or more hardwarecomputer-storage media having embodied thereon computer-usableinstructions that, when executed, facilitate a method of featurecompletion for machine learning, the method comprising: storing a firstset of data items, wherein each data item includes a text stream ofwords; providing a dictionary, wherein the dictionary includes a list ofwords that define a concept usable as an input feature for training amachine-learning model to score data items with a probability of being apositive example or a negative example of a particular class of dataitem; providing a feature that is trained to calculate a firstprobability of a presence, within a stream of one or more words, of adisjunction of one or more n-grams that correspond semantically to theconcept defined by the words in the dictionary; utilizing the feature todetermine the first probability of the presence, within a stream of oneor more words, of a disjunction of one or more n-grams that correspondsemantically to the concept defined by the words in the dictionary at agiven word position in the data item; providing a machine-learning modelthat is trainable to calculate a second probability of the presence,within the stream of one or more words at the given word position, ofthe disjunction of the one or more n-grams that correspond semanticallyto the concept defined by the words in the dictionary, based on one ormore words in the data item not utilized by the feature to determine thefirst probability; utilizing the machine-learning model to determine thesecond probability of the presence, within the stream of one or morewords at the given word position, of a disjunction of one or moren-grams that correspond semantically to the concept defined by the wordsin the dictionary, based on the one or more words in the data item notutilized by the feature to determine the first probability; determiningan actual presence or absence, at the given word position, of thedisjunction of the one or more n-grams that correspond semantically tothe concept defined by the words in the dictionary; and modifying themachine-learning model to adjust the second probability in a positive ornegative direction based on the determined actual presence or absence ofthe disjunction of the one or more n-grams that correspond semanticallyto the concept defined by the words in the dictionary; wherein thefeature determines one or more of: whether any words from a given listappear at the center of a window of text around the given word positionin which center words in the window of text have been removed, apresence or absence of a verb in the window, a presence or absence of anoun followed by an adjective, or a number of occurrences of a givenword in the window.
 15. The media of claim 14, wherein the feature is aregular expression operating over strings to predict semanticallymatching positions in text within a string at each considered position,while the machine-learning model input includes a window of text aroundthe considered position in which center words in the window of text havebeen removed.
 16. The media of claim 14, wherein modifying themachine-learning model to adjust the calculated probability includesadjusting the calculated probability in a positive direction when thedisjunction of the one or more n-grams is present.
 17. The media ofclaim 16, wherein modifying the machine-learning model to adjust thecalculated probability includes adjusting the calculated probability ina negative direction when the disjunction of the one or more n-grams isnot present.
 18. The media of claim 14, wherein the feature determinesthe presence of a disjunction of one or more n-grams at each consideredposition in a text stream, while the machine-learning model inputincludes a window of text around the considered position in which centerwords in the window of text have been removed.
 19. The media of claim14, wherein utilizing the one or more words in the data item notutilized by the feature includes utilizing a text window that includes anumber of words immediately preceding a given word position and a numberof words immediately following the given word position.
 20. The media ofclaim 19, wherein the text window is a sliding window.